↑ Up

E-SAT---3.5.1.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E-SAT---3.5.1
% Problem  : GEO068-3 : TPTP v9.3.1. Bugfixed v1.2.1.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM

% Computer : n001.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:29:00 PM UTC 2026

% Result   : Unsatisfiable 0.16s 5.67s
% Output   : CNFRefutation 0.16s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   13
% Syntax   : Number of clauses     :   53 (  23 unt;   6 nHn;  53 RR)
%            Number of literals    :  106 (   0 equ;  50 neg)
%            Maximal clause size   :    5 (   2 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-4 aty)
%            Number of functors    :    6 (   6 usr;   6 con; 0-0 aty)
%            Number of variables   :   90 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(d4_4,axiom,
    ( ~ equidistant(X1,X2,X3,X4)
    | equidistant(X4,X3,X1,X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d4_4) ).

cnf(t10_1,axiom,
    ( ~ colinear(X1,X2,X3)
    | colinear(X3,X2,X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t10_1) ).

cnf(v_to_w_equals_v1_to_w1,hypothesis,
    equidistant(v,w,v1,w1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',v_to_w_equals_v1_to_w1) ).

cnf(colinearity4,axiom,
    ( ~ colinear(X1,X2,X3)
    | between(X3,X1,X2)
    | between(X2,X3,X1)
    | between(X1,X2,X3) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/GEO002-1.ax',colinearity4) ).

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

cnf(b11,axiom,
    ( ~ between(X1,X2,X5)
    | ~ equidistant(X1,X5,X3,X6)
    | ~ equidistant(X2,X5,X4,X6)
    | ~ equidistant(X1,X2,X3,X4)
    | between(X3,X4,X6) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',b11) ).

cnf(prove_u1v1w1_colinear,negated_conjecture,
    ~ colinear(u1,v1,w1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_u1v1w1_colinear) ).

cnf(c2_2,axiom,
    ( ~ between(X1,X2,X3)
    | colinear(X1,X3,X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c2_2) ).

cnf(t1,axiom,
    ( ~ between(X1,X2,X3)
    | between(X3,X2,X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t1) ).

cnf(colinearity1,axiom,
    ( ~ between(X1,X2,X3)
    | colinear(X1,X2,X3) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/GEO002-1.ax',colinearity1) ).

cnf(u_to_w_equals_u1_to_w1,hypothesis,
    equidistant(u,w,u1,w1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',u_to_w_equals_u1_to_w1) ).

cnf(u_to_v_equals_u1_to_v1,hypothesis,
    equidistant(u,v,u1,v1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',u_to_v_equals_u1_to_v1) ).

cnf(c2_3,axiom,
    ( ~ between(X1,X2,X3)
    | colinear(X2,X1,X3) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c2_3) ).

cnf(c_0_13,plain,
    ( ~ equidistant(X1,X2,X3,X4)
    | equidistant(X4,X3,X1,X2) ),
    inference(fof_simplification,[status(thm)],[d4_4]) ).

cnf(c_0_14,plain,
    ( ~ colinear(X1,X2,X3)
    | colinear(X3,X2,X1) ),
    inference(fof_simplification,[status(thm)],[t10_1]) ).

cnf(c_0_15,plain,
    ( ~ equidistant(X1,X2,X3,X4)
    | equidistant(X4,X3,X1,X2) ),
    c_0_13 ).

cnf(c_0_16,hypothesis,
    equidistant(v,w,v1,w1),
    v_to_w_equals_v1_to_w1 ).

cnf(c_0_17,plain,
    ( ~ colinear(X1,X2,X3)
    | between(X3,X1,X2)
    | between(X2,X3,X1)
    | between(X1,X2,X3) ),
    inference(fof_simplification,[status(thm)],[colinearity4]) ).

cnf(c_0_18,plain,
    ( ~ colinear(X1,X2,X3)
    | colinear(X3,X2,X1) ),
    c_0_14 ).

cnf(c_0_19,hypothesis,
    colinear(u,v,w),
    uvw_colinear ).

cnf(c_0_20,plain,
    ( ~ between(X1,X2,X5)
    | ~ equidistant(X1,X5,X3,X6)
    | ~ equidistant(X2,X5,X4,X6)
    | ~ equidistant(X1,X2,X3,X4)
    | between(X3,X4,X6) ),
    inference(fof_simplification,[status(thm)],[b11]) ).

cnf(c_0_21,hypothesis,
    equidistant(w1,v1,v,w),
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

cnf(c_0_22,negated_conjecture,
    ~ colinear(u1,v1,w1),
    inference(fof_simplification,[status(thm)],[prove_u1v1w1_colinear]) ).

cnf(c_0_23,plain,
    ( ~ between(X1,X2,X3)
    | colinear(X1,X3,X2) ),
    inference(fof_simplification,[status(thm)],[c2_2]) ).

cnf(c_0_24,plain,
    ( ~ between(X1,X2,X3)
    | between(X3,X2,X1) ),
    inference(fof_simplification,[status(thm)],[t1]) ).

cnf(c_0_25,plain,
    ( ~ colinear(X1,X2,X3)
    | between(X3,X1,X2)
    | between(X2,X3,X1)
    | between(X1,X2,X3) ),
    c_0_17 ).

cnf(c_0_26,hypothesis,
    colinear(w,v,u),
    inference(spm,[status(thm)],[c_0_18,c_0_19]) ).

cnf(c_0_27,plain,
    ( ~ between(X1,X2,X5)
    | ~ equidistant(X1,X5,X3,X6)
    | ~ equidistant(X2,X5,X4,X6)
    | ~ equidistant(X1,X2,X3,X4)
    | between(X3,X4,X6) ),
    c_0_20 ).

cnf(c_0_28,hypothesis,
    equidistant(w,v,w1,v1),
    inference(spm,[status(thm)],[c_0_15,c_0_21]) ).

cnf(c_0_29,negated_conjecture,
    ~ colinear(u1,v1,w1),
    c_0_22 ).

cnf(c_0_30,plain,
    ( ~ between(X1,X2,X3)
    | colinear(X1,X3,X2) ),
    c_0_23 ).

cnf(c_0_31,plain,
    ( ~ between(X1,X2,X3)
    | colinear(X1,X2,X3) ),
    inference(fof_simplification,[status(thm)],[colinearity1]) ).

cnf(c_0_32,plain,
    ( ~ between(X1,X2,X3)
    | between(X3,X2,X1) ),
    c_0_24 ).

cnf(c_0_33,hypothesis,
    ( between(w,v,u)
    | between(v,u,w)
    | between(u,w,v) ),
    inference(spm,[status(thm)],[c_0_25,c_0_26]) ).

cnf(c_0_34,hypothesis,
    ( ~ equidistant(X2,w,X1,w1)
    | ~ equidistant(X2,v,X1,v1)
    | ~ between(X2,w,v)
    | between(X1,w1,v1) ),
    inference(spm,[status(thm)],[c_0_27,c_0_28]) ).

cnf(c_0_35,hypothesis,
    equidistant(u,w,u1,w1),
    u_to_w_equals_u1_to_w1 ).

cnf(c_0_36,hypothesis,
    equidistant(u,v,u1,v1),
    u_to_v_equals_u1_to_v1 ).

cnf(c_0_37,negated_conjecture,
    ~ between(u1,w1,v1),
    inference(spm,[status(thm)],[c_0_29,c_0_30]) ).

cnf(c_0_38,plain,
    ( ~ between(X1,X2,X3)
    | colinear(X1,X2,X3) ),
    c_0_31 ).

cnf(c_0_39,hypothesis,
    ( between(u,v,w)
    | between(u,w,v)
    | between(v,u,w) ),
    inference(spm,[status(thm)],[c_0_32,c_0_33]) ).

cnf(c_0_40,hypothesis,
    ~ between(u,w,v),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36])]),c_0_37]) ).

cnf(c_0_41,hypothesis,
    ( ~ equidistant(X2,v,X1,v1)
    | ~ equidistant(X2,w,X1,w1)
    | ~ between(X2,v,w)
    | between(X1,v1,w1) ),
    inference(spm,[status(thm)],[c_0_27,c_0_16]) ).

cnf(c_0_42,negated_conjecture,
    ~ between(u1,v1,w1),
    inference(spm,[status(thm)],[c_0_29,c_0_38]) ).

cnf(c_0_43,plain,
    ( ~ between(X1,X2,X3)
    | colinear(X2,X1,X3) ),
    inference(fof_simplification,[status(thm)],[c2_3]) ).

cnf(c_0_44,hypothesis,
    ( between(v,u,w)
    | between(u,v,w) ),
    inference(sr,[status(thm)],[c_0_39,c_0_40]) ).

cnf(c_0_45,hypothesis,
    ~ between(u,v,w),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_35]),c_0_36])]),c_0_42]) ).

cnf(c_0_46,hypothesis,
    equidistant(v1,u1,u,v),
    inference(spm,[status(thm)],[c_0_15,c_0_36]) ).

cnf(c_0_47,plain,
    ( ~ between(X1,X2,X3)
    | colinear(X2,X1,X3) ),
    c_0_43 ).

cnf(c_0_48,hypothesis,
    ( ~ equidistant(X2,u,X1,u1)
    | ~ equidistant(X2,w,X1,w1)
    | ~ between(X2,u,w)
    | between(X1,u1,w1) ),
    inference(spm,[status(thm)],[c_0_27,c_0_35]) ).

cnf(c_0_49,hypothesis,
    between(v,u,w),
    inference(sr,[status(thm)],[c_0_44,c_0_45]) ).

cnf(c_0_50,hypothesis,
    equidistant(v,u,v1,u1),
    inference(spm,[status(thm)],[c_0_15,c_0_46]) ).

cnf(c_0_51,negated_conjecture,
    ~ between(v1,u1,w1),
    inference(spm,[status(thm)],[c_0_29,c_0_47]) ).

cnf(c_0_52,hypothesis,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_16]),c_0_49]),c_0_50])]),c_0_51]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : GEO068-3 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.04  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/5.38  % Computer : n001.cluster.edu
% 0.11/5.38  % Model    : x86_64 x86_64
% 0.11/5.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/5.38  % Memory   : 8046.5625MB
% 0.11/5.38  % OS       : Linux 6.8.0-71-generic
% 0.11/5.38  % CPULimit : 300
% 0.11/5.38  % WCLimit  : 300
% 0.11/5.38  % DateTime : Sun Sep 20 09:36:35 UTC 2026
% 0.11/5.38  % CPUTime  : 
% 0.11/5.38  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.16/5.43  Running first-order theorem proving
% 0.16/5.43  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.16/5.67  % Version: 3.5.1
% 0.16/5.67  % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.16/5.67  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/5.67  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.16/5.67  % Starting new_bool_3 with 300s (1) cores
% 0.16/5.67  % Starting new_bool_1 with 300s (1) cores
% 0.16/5.67  % Starting sh5l with 300s (1) cores
% 0.16/5.67  % new_bool_1 with pid 462333 completed with status 0
% 0.16/5.67  % Result found by new_bool_1
% 0.16/5.67  % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.16/5.67  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/5.67  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.16/5.67  % Starting new_bool_3 with 300s (1) cores
% 0.16/5.67  % Starting new_bool_1 with 300s (1) cores
% 0.16/5.67  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.16/5.67  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/5.67  % Search class: FGUSM-FFMS00-SFFFFFNN
% 0.16/5.67  % partial match(2): FGUSM-FFMS33-SFFFFFNN
% 0.16/5.67  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/5.67  % Starting SubtermCWHack with 31s (1) cores
% 0.16/5.67  % SubtermCWHack with pid 462338 completed with status 0
% 0.16/5.67  % Result found by SubtermCWHack
% 0.16/5.67  % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.16/5.67  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/5.67  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.16/5.67  % Starting new_bool_3 with 300s (1) cores
% 0.16/5.67  % Starting new_bool_1 with 300s (1) cores
% 0.16/5.67  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.16/5.67  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/5.67  % Search class: FGUSM-FFMS00-SFFFFFNN
% 0.16/5.67  % partial match(2): FGUSM-FFMS33-SFFFFFNN
% 0.16/5.67  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/5.67  % Starting SubtermCWHack with 31s (1) cores
% 0.16/5.67  % Preprocessing time       : 0.001 s
% 0.16/5.67  
% 0.16/5.67  % Proof found!
% 0.16/5.67  % SZS status Unsatisfiable
% 0.16/5.67  % SZS output start CNFRefutation
% See solution above
% 0.16/5.67  % Parsed axioms                        : 105
% 0.16/5.67  % Removed by relevancy pruning/SinE    : 39
% 0.16/5.67  % Initial clauses                      : 66
% 0.16/5.67  % Removed in clause preprocessing      : 1
% 0.16/5.67  % Initial clauses in saturation        : 65
% 0.16/5.67  % Processed clauses                    : 5522
% 0.16/5.67  % ...of these trivial                  : 9
% 0.16/5.67  % ...subsumed                          : 4244
% 0.16/5.67  % ...remaining for further processing  : 1269
% 0.16/5.67  % Other redundant clauses eliminated   : 2
% 0.16/5.67  % Clauses deleted for lack of memory   : 0
% 0.16/5.67  % Backward-subsumed                    : 33
% 0.16/5.67  % Backward-rewritten                   : 12
% 0.16/5.67  % Generated clauses                    : 20360
% 0.16/5.67  % ...of the previous two non-redundant : 17217
% 0.16/5.67  % ...aggressively subsumed             : 0
% 0.16/5.67  % Contextual simplify-reflections      : 4
% 0.16/5.67  % Paramodulations                      : 20353
% 0.16/5.67  % Factorizations                       : 0
% 0.16/5.67  % NegExts                              : 0
% 0.16/5.67  % Equation resolutions                 : 2
% 0.16/5.67  % Disequality decompositions           : 0
% 0.16/5.67  % Total rewrite steps                  : 6240
% 0.16/5.67  % ...of those cached                   : 6102
% 0.16/5.67  % Propositional unsat checks           : 0
% 0.16/5.67  %    Propositional check models        : 0
% 0.16/5.67  %    Propositional check unsatisfiable : 0
% 0.16/5.67  %    Propositional clauses             : 0
% 0.16/5.67  %    Propositional clauses after purity: 0
% 0.16/5.67  %    Propositional unsat core size     : 0
% 0.16/5.67  %    Propositional preprocessing time  : 0.000
% 0.16/5.67  %    Propositional encoding time       : 0.000
% 0.16/5.67  %    Propositional solver time         : 0.000
% 0.16/5.67  %    Success case prop preproc time    : 0.000
% 0.16/5.67  %    Success case prop encoding time   : 0.000
% 0.16/5.67  %    Success case prop solver time     : 0.000
% 0.16/5.67  % Current number of processed clauses  : 1217
% 0.16/5.67  %    Positive orientable unit clauses  : 40
% 0.16/5.67  %    Positive unorientable unit clauses: 0
% 0.16/5.67  %    Negative unit clauses             : 17
% 0.16/5.67  %    Non-unit-clauses                  : 1160
% 0.16/5.67  % Current number of unprocessed clauses: 11727
% 0.16/5.67  % ...number of literals in the above   : 48535
% 0.16/5.67  % Current number of archived formulas  : 0
% 0.16/5.67  % Current number of archived clauses   : 50
% 0.16/5.67  % Clause-clause subsumption calls (NU) : 426690
% 0.16/5.67  % Rec. Clause-clause subsumption calls : 352958
% 0.16/5.67  % Non-unit clause-clause subsumptions  : 4251
% 0.16/5.67  % Unit Clause-clause subsumption calls : 3110
% 0.16/5.67  % Rewrite failures with RHS unbound    : 0
% 0.16/5.67  % BW rewrite match attempts            : 36
% 0.16/5.67  % BW rewrite match successes           : 1
% 0.16/5.67  % Condensation attempts                : 0
% 0.16/5.67  % Condensation successes               : 0
% 0.16/5.67  % Termbank termtop insertions          : 295450
% 0.16/5.67  % Search garbage collected termcells   : 309
% 0.16/5.67  
% 0.16/5.67  % -------------------------------------------------
% 0.16/5.67  % User time                : 0.213 s
% 0.16/5.67  % System time              : 0.008 s
% 0.16/5.67  % Total time               : 0.221 s
% 0.16/5.67  % Maximum resident set size: 3712 pages
% 0.16/5.67  
% 0.16/5.67  % -------------------------------------------------
% 0.16/5.67  % User time                : 0.216 s
% 0.16/5.67  % System time              : 0.013 s
% 0.16/5.67  % Total time               : 0.229 s
% 0.16/5.67  % Maximum resident set size: 4864 pages
% 0.16/5.67  % E exiting
%------------------------------------------------------------------------------