↑ Up

E---3.5.1.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : GEO048-2 : TPTP v9.3.1. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM

% Computer : n020.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Thu Sep 24 12:27:00 PM UTC 2026

% Result   : Unsatisfiable 0.14s 5.64s
% Output   : CNFRefutation 0.14s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   10
% Syntax   : Number of clauses     :   36 (  18 unt;   0 nHn;  30 RR)
%            Number of literals    :   62 (   8 equ;  32 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-4 aty)
%            Number of functors    :    8 (   8 usr;   6 con; 0-5 aty)
%            Number of variables   :   76 (   8 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(identity_for_betweeness,axiom,
    ( ~ between(X1,X2,X1)
    | X1 = X2 ),
    file('/export/starexec/sandbox2/benchmark/Axioms/GEO002-0.ax',identity_for_betweeness) ).

cnf(inner_pasch2,axiom,
    ( ~ between(X4,X5,X3)
    | ~ between(X1,X2,X3)
    | between(X5,inner_pasch(X1,X2,X3,X5,X4),X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/GEO002-0.ax',inner_pasch2) ).

cnf(inner_pasch1,axiom,
    ( ~ between(X4,X5,X3)
    | ~ between(X1,X2,X3)
    | between(X2,inner_pasch(X1,X2,X3,X5,X4),X4) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/GEO002-0.ax',inner_pasch1) ).

cnf(identity_for_equidistance,axiom,
    ( ~ equidistant(X1,X2,X3,X3)
    | X1 = X2 ),
    file('/export/starexec/sandbox2/benchmark/Axioms/GEO002-0.ax',identity_for_equidistance) ).

cnf(prove_conclusion2,negated_conjecture,
    ~ between(v,inner_pasch(v1,inner_pasch(u,x,u1,v1,w),u,v,w),v1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_conclusion2) ).

cnf(segment_construction2,axiom,
    equidistant(X1,extension(X2,X1,X3,X4),X3,X4),
    file('/export/starexec/sandbox2/benchmark/Axioms/GEO002-0.ax',segment_construction2) ).

cnf(v1_between_u1_and_w,hypothesis,
    between(u1,v1,w),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',v1_between_u1_and_w) ).

cnf(segment_construction1,axiom,
    between(X1,X2,extension(X1,X2,X3,X4)),
    file('/export/starexec/sandbox2/benchmark/Axioms/GEO002-0.ax',segment_construction1) ).

cnf(x_between_u_and_u1,hypothesis,
    between(u,x,u1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',x_between_u_and_u1) ).

cnf(v_between_u_and_w,hypothesis,
    between(u,v,w),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',v_between_u_and_w) ).

cnf(c_0_10,plain,
    ( ~ between(X1,X2,X1)
    | X1 = X2 ),
    inference(fof_simplification,[status(thm)],[identity_for_betweeness]) ).

cnf(c_0_11,plain,
    ( ~ between(X4,X5,X3)
    | ~ between(X1,X2,X3)
    | between(X5,inner_pasch(X1,X2,X3,X5,X4),X1) ),
    inference(fof_simplification,[status(thm)],[inner_pasch2]) ).

cnf(c_0_12,plain,
    ( ~ between(X4,X5,X3)
    | ~ between(X1,X2,X3)
    | between(X2,inner_pasch(X1,X2,X3,X5,X4),X4) ),
    inference(fof_simplification,[status(thm)],[inner_pasch1]) ).

cnf(c_0_13,plain,
    ( ~ between(X1,X2,X1)
    | X1 = X2 ),
    c_0_10 ).

cnf(c_0_14,plain,
    ( ~ between(X4,X5,X3)
    | ~ between(X1,X2,X3)
    | between(X5,inner_pasch(X1,X2,X3,X5,X4),X1) ),
    c_0_11 ).

cnf(c_0_15,plain,
    ( ~ equidistant(X1,X2,X3,X3)
    | X1 = X2 ),
    inference(fof_simplification,[status(thm)],[identity_for_equidistance]) ).

cnf(c_0_16,negated_conjecture,
    ~ between(v,inner_pasch(v1,inner_pasch(u,x,u1,v1,w),u,v,w),v1),
    inference(fof_simplification,[status(thm)],[prove_conclusion2]) ).

cnf(c_0_17,plain,
    ( ~ between(X4,X5,X3)
    | ~ between(X1,X2,X3)
    | between(X2,inner_pasch(X1,X2,X3,X5,X4),X4) ),
    c_0_12 ).

cnf(c_0_18,plain,
    ( ~ between(X1,X2,X3)
    | ~ between(X4,X1,X3)
    | inner_pasch(X1,X2,X3,X1,X4) = X1 ),
    inference(spm,[status(thm)],[c_0_13,c_0_14]) ).

cnf(c_0_19,plain,
    ( ~ equidistant(X1,X2,X3,X3)
    | X1 = X2 ),
    c_0_15 ).

cnf(c_0_20,axiom,
    equidistant(X1,extension(X2,X1,X3,X4),X3,X4),
    segment_construction2 ).

cnf(c_0_21,negated_conjecture,
    ~ between(v,inner_pasch(v1,inner_pasch(u,x,u1,v1,w),u,v,w),v1),
    c_0_16 ).

cnf(c_0_22,plain,
    ( ~ between(X2,X1,X4)
    | ~ between(X3,X2,X4)
    | between(X1,X2,X3) ),
    inference(spm,[status(thm)],[c_0_17,c_0_18]) ).

cnf(c_0_23,hypothesis,
    between(u1,v1,w),
    v1_between_u1_and_w ).

cnf(c_0_24,axiom,
    between(X1,X2,extension(X1,X2,X3,X4)),
    segment_construction1 ).

cnf(c_0_25,plain,
    extension(X1,X2,X3,X3) = X2,
    inference(spm,[status(thm)],[c_0_19,c_0_20]) ).

cnf(c_0_26,negated_conjecture,
    ( ~ between(w,v,u)
    | ~ between(v1,inner_pasch(u,x,u1,v1,w),u) ),
    inference(spm,[status(thm)],[c_0_21,c_0_14]) ).

cnf(c_0_27,hypothesis,
    between(u,x,u1),
    x_between_u_and_u1 ).

cnf(c_0_28,hypothesis,
    ( ~ between(v1,X1,w)
    | between(X1,v1,u1) ),
    inference(spm,[status(thm)],[c_0_22,c_0_23]) ).

cnf(c_0_29,plain,
    between(X1,X2,X2),
    inference(spm,[status(thm)],[c_0_24,c_0_25]) ).

cnf(c_0_30,hypothesis,
    between(u,v,w),
    v_between_u_and_w ).

cnf(c_0_31,negated_conjecture,
    ( ~ between(w,v1,u1)
    | ~ between(w,v,u) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_14]),c_0_27])]) ).

cnf(c_0_32,hypothesis,
    between(w,v1,u1),
    inference(spm,[status(thm)],[c_0_28,c_0_29]) ).

cnf(c_0_33,hypothesis,
    ( ~ between(v,X1,w)
    | between(X1,v,u) ),
    inference(spm,[status(thm)],[c_0_22,c_0_30]) ).

cnf(c_0_34,negated_conjecture,
    ~ between(w,v,u),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_32])]) ).

cnf(c_0_35,hypothesis,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_29]),c_0_34]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : GEO048-2 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/5.57  % Computer : n020.cluster.edu
% 0.11/5.57  % Model    : x86_64 x86_64
% 0.11/5.57  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/5.57  % Memory   : 8046.5625MB
% 0.11/5.57  % OS       : Linux 6.8.0-71-generic
% 0.11/5.57  % CPULimit : 300
% 0.11/5.57  % WCLimit  : 300
% 0.11/5.57  % DateTime : Sun Sep 20 08:40:52 UTC 2026
% 0.11/5.57  % CPUTime  : 
% 0.11/5.57  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/5.62  Running first-order theorem proving
% 0.14/5.62  Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.14/5.64  % Version: 3.5.1
% 0.14/5.64  % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.14/5.64  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/5.64  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.14/5.64  % Starting new_bool_3 with 300s (1) cores
% 0.14/5.64  % Starting new_bool_1 with 300s (1) cores
% 0.14/5.64  % Starting sh5l with 300s (1) cores
% 0.14/5.64  % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 272467 completed with status 0
% 0.14/5.64  % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.14/5.64  % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.14/5.64  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/5.64  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.14/5.64  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/5.64  % No SInE strategy applied
% 0.14/5.64  % Search class: FGUSS-FFMS33-SFFFFFNN
% 0.14/5.64  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/5.64  % Starting SubtermCWHack with 136s (1) cores
% 0.14/5.64  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.14/5.64  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S0Y with 193s (1) cores
% 0.14/5.64  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S0Y with 161s (1) cores
% 0.14/5.64  % Starting new_bool_3 with 161s (1) cores
% 0.14/5.64  % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S0Y with pid 272476 completed with status 0
% 0.14/5.64  % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S0Y
% 0.14/5.64  % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.14/5.64  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/5.64  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.14/5.64  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/5.64  % No SInE strategy applied
% 0.14/5.64  % Search class: FGUSS-FFMS33-SFFFFFNN
% 0.14/5.64  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/5.64  % Starting SubtermCWHack with 136s (1) cores
% 0.14/5.64  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.14/5.64  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S0Y with 193s (1) cores
% 0.14/5.64  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S0Y with 161s (1) cores
% 0.14/5.64  % Preprocessing time       : 0.002 s
% 0.14/5.64  % Presaturation interreduction done
% 0.14/5.64  
% 0.14/5.64  % Proof found!
% 0.14/5.64  % SZS status Unsatisfiable
% 0.14/5.64  % SZS output start CNFRefutation
% See solution above
% 0.14/5.64  % Parsed axioms                        : 23
% 0.14/5.64  % Removed by relevancy pruning/SinE    : 0
% 0.14/5.64  % Initial clauses                      : 23
% 0.14/5.64  % Removed in clause preprocessing      : 0
% 0.14/5.64  % Initial clauses in saturation        : 23
% 0.14/5.64  % Processed clauses                    : 64
% 0.14/5.64  % ...of these trivial                  : 1
% 0.14/5.64  % ...subsumed                          : 0
% 0.14/5.64  % ...remaining for further processing  : 63
% 0.14/5.64  % Other redundant clauses eliminated   : 0
% 0.14/5.64  % Clauses deleted for lack of memory   : 0
% 0.14/5.64  % Backward-subsumed                    : 1
% 0.14/5.64  % Backward-rewritten                   : 1
% 0.14/5.64  % Generated clauses                    : 61
% 0.14/5.64  % ...of the previous two non-redundant : 53
% 0.14/5.64  % ...aggressively subsumed             : 0
% 0.14/5.64  % Contextual simplify-reflections      : 0
% 0.14/5.64  % Paramodulations                      : 61
% 0.14/5.64  % Factorizations                       : 0
% 0.14/5.64  % NegExts                              : 0
% 0.14/5.64  % Equation resolutions                 : 0
% 0.14/5.64  % Disequality decompositions           : 0
% 0.14/5.64  % Total rewrite steps                  : 11
% 0.14/5.64  % ...of those cached                   : 5
% 0.14/5.64  % Propositional unsat checks           : 0
% 0.14/5.64  %    Propositional check models        : 0
% 0.14/5.64  %    Propositional check unsatisfiable : 0
% 0.14/5.64  %    Propositional clauses             : 0
% 0.14/5.64  %    Propositional clauses after purity: 0
% 0.14/5.64  %    Propositional unsat core size     : 0
% 0.14/5.64  %    Propositional preprocessing time  : 0.000
% 0.14/5.64  %    Propositional encoding time       : 0.000
% 0.14/5.64  %    Propositional solver time         : 0.000
% 0.14/5.64  %    Success case prop preproc time    : 0.000
% 0.14/5.64  %    Success case prop encoding time   : 0.000
% 0.14/5.64  %    Success case prop solver time     : 0.000
% 0.14/5.64  % Current number of processed clauses  : 38
% 0.14/5.64  %    Positive orientable unit clauses  : 12
% 0.14/5.64  %    Positive unorientable unit clauses: 0
% 0.14/5.64  %    Negative unit clauses             : 6
% 0.14/5.64  %    Non-unit-clauses                  : 20
% 0.14/5.64  % Current number of unprocessed clauses: 33
% 0.14/5.64  % ...number of literals in the above   : 149
% 0.14/5.64  % Current number of archived formulas  : 0
% 0.14/5.64  % Current number of archived clauses   : 25
% 0.14/5.64  % Clause-clause subsumption calls (NU) : 295
% 0.14/5.64  % Rec. Clause-clause subsumption calls : 117
% 0.14/5.64  % Non-unit clause-clause subsumptions  : 0
% 0.14/5.64  % Unit Clause-clause subsumption calls : 36
% 0.14/5.64  % Rewrite failures with RHS unbound    : 0
% 0.14/5.64  % BW rewrite match attempts            : 97
% 0.14/5.64  % BW rewrite match successes           : 1
% 0.14/5.64  % Condensation attempts                : 0
% 0.14/5.64  % Condensation successes               : 0
% 0.14/5.64  % Termbank termtop insertions          : 1647
% 0.14/5.64  % Search garbage collected termcells   : 77
% 0.14/5.64  
% 0.14/5.64  % -------------------------------------------------
% 0.14/5.64  % User time                : 0.005 s
% 0.14/5.64  % System time              : 0.005 s
% 0.14/5.64  % Total time               : 0.011 s
% 0.14/5.64  % Maximum resident set size: 3656 pages
% 0.14/5.64  
% 0.14/5.64  % -------------------------------------------------
% 0.14/5.64  % User time                : 0.032 s
% 0.14/5.64  % System time              : 0.019 s
% 0.14/5.64  % Total time               : 0.050 s
% 0.14/5.64  % Maximum resident set size: 4608 pages
% 0.14/5.64  % E exiting
%------------------------------------------------------------------------------