↑ 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  : GEO069-3 : TPTP v9.3.1. Bugfixed v1.2.1.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM

% Computer : n019.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.13s 5.46s
% Output   : CNFRefutation 0.13s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   13
% Syntax   : Number of clauses     :   55 (  21 unt;   6 nHn;  53 RR)
%            Number of literals    :  101 (   6 equ;  49 neg)
%            Maximal clause size   :    4 (   1 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-3 aty)
%            Number of functors    :    4 (   4 usr;   4 con; 0-0 aty)
%            Number of variables   :   83 (   2 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(t10_4,axiom,
    ( ~ colinear(X1,X2,X3)
    | colinear(X3,X1,X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t10_4) ).

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

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

cnf(xvu_colinear,hypothesis,
    colinear(x,v,u),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',xvu_colinear) ).

cnf(t12_2,axiom,
    ( ~ colinear(X1,X2,X4)
    | ~ colinear(X1,X2,X3)
    | X1 = X2
    | colinear(X2,X3,X4) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t12_2) ).

cnf(u_not_v,hypothesis,
    u != v,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',u_not_v) ).

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

cnf(prove_xwu_and_xwv_colinear,negated_conjecture,
    ( ~ colinear(x,w,v)
    | ~ colinear(x,w,u) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_xwu_and_xwv_colinear) ).

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

cnf(c3_2,axiom,
    colinear(X1,X2,X1),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',c3_2) ).

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

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

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

cnf(c_0_13,plain,
    ( ~ colinear(X1,X2,X3)
    | colinear(X3,X1,X2) ),
    inference(fof_simplification,[status(thm)],[t10_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,
    ( ~ colinear(X1,X2,X3)
    | colinear(X3,X1,X2) ),
    c_0_13 ).

cnf(c_0_16,hypothesis,
    colinear(w,v,u),
    wvu_colinear ).

cnf(c_0_17,hypothesis,
    colinear(x,v,u),
    xvu_colinear ).

cnf(c_0_18,plain,
    ( ~ colinear(X1,X2,X4)
    | ~ colinear(X1,X2,X3)
    | X1 = X2
    | colinear(X2,X3,X4) ),
    inference(fof_simplification,[status(thm)],[t12_2]) ).

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

cnf(c_0_20,hypothesis,
    u != v,
    inference(fof_simplification,[status(thm)],[u_not_v]) ).

cnf(c_0_21,hypothesis,
    colinear(u,w,v),
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

cnf(c_0_22,hypothesis,
    colinear(u,x,v),
    inference(spm,[status(thm)],[c_0_15,c_0_17]) ).

cnf(c_0_23,plain,
    ( ~ colinear(X1,X2,X4)
    | ~ colinear(X1,X2,X3)
    | X1 = X2
    | colinear(X2,X3,X4) ),
    c_0_18 ).

cnf(c_0_24,hypothesis,
    colinear(u,v,x),
    inference(spm,[status(thm)],[c_0_19,c_0_17]) ).

cnf(c_0_25,hypothesis,
    u != v,
    c_0_20 ).

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

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

cnf(c_0_28,hypothesis,
    colinear(v,u,x),
    inference(spm,[status(thm)],[c_0_15,c_0_22]) ).

cnf(c_0_29,negated_conjecture,
    ( ~ colinear(x,w,v)
    | ~ colinear(x,w,u) ),
    inference(fof_simplification,[status(thm)],[prove_xwu_and_xwv_colinear]) ).

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

cnf(c_0_31,hypothesis,
    ( ~ colinear(u,v,X1)
    | colinear(v,X1,x) ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]) ).

cnf(c_0_32,hypothesis,
    ( ~ colinear(v,u,X1)
    | colinear(u,X1,w) ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_26]),c_0_25]) ).

cnf(c_0_33,axiom,
    colinear(X1,X2,X1),
    c3_2 ).

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

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

cnf(c_0_36,plain,
    ( ~ colinear(X1,X2,X3)
    | colinear(X2,X3,X1) ),
    c_0_27 ).

cnf(c_0_37,hypothesis,
    ( ~ colinear(v,u,X1)
    | colinear(u,X1,x) ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_28]),c_0_25]) ).

cnf(c_0_38,negated_conjecture,
    ( ~ colinear(x,w,v)
    | ~ colinear(x,w,u) ),
    c_0_29 ).

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

cnf(c_0_40,hypothesis,
    colinear(v,w,x),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33])]) ).

cnf(c_0_41,plain,
    ( ~ between(X1,X2,X3)
    | colinear(X1,X3,X2) ),
    c_0_34 ).

cnf(c_0_42,plain,
    ( ~ between(X1,X2,X3)
    | colinear(X3,X2,X1) ),
    c_0_35 ).

cnf(c_0_43,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_44,hypothesis,
    ( ~ colinear(v,u,X1)
    | colinear(X1,x,u) ),
    inference(spm,[status(thm)],[c_0_36,c_0_37]) ).

cnf(c_0_45,negated_conjecture,
    ( ~ between(w,x,u)
    | ~ colinear(x,w,v) ),
    inference(spm,[status(thm)],[c_0_38,c_0_39]) ).

cnf(c_0_46,hypothesis,
    colinear(x,w,v),
    inference(spm,[status(thm)],[c_0_19,c_0_40]) ).

cnf(c_0_47,negated_conjecture,
    ( ~ between(x,u,w)
    | ~ colinear(x,w,v) ),
    inference(spm,[status(thm)],[c_0_38,c_0_41]) ).

cnf(c_0_48,negated_conjecture,
    ( ~ between(u,w,x)
    | ~ colinear(x,w,v) ),
    inference(spm,[status(thm)],[c_0_38,c_0_42]) ).

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

cnf(c_0_50,hypothesis,
    colinear(w,x,u),
    inference(spm,[status(thm)],[c_0_44,c_0_26]) ).

cnf(c_0_51,negated_conjecture,
    ~ between(w,x,u),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_45,c_0_46])]) ).

cnf(c_0_52,negated_conjecture,
    ~ between(x,u,w),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_47,c_0_46])]) ).

cnf(c_0_53,negated_conjecture,
    ~ between(u,w,x),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_48,c_0_46])]) ).

cnf(c_0_54,hypothesis,
    $false,
    inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_51]),c_0_52]),c_0_53]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : GEO069-3 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/5.37  % Computer : n019.cluster.edu
% 0.09/5.37  % Model    : x86_64 x86_64
% 0.09/5.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/5.37  % Memory   : 8046.5625MB
% 0.09/5.37  % OS       : Linux 6.8.0-71-generic
% 0.09/5.37  % CPULimit : 300
% 0.09/5.37  % WCLimit  : 300
% 0.09/5.37  % DateTime : Sun Sep 20 09:35:11 UTC 2026
% 0.09/5.37  % CPUTime  : 
% 0.09/5.37  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/5.43  Running first-order theorem proving
% 0.13/5.43  Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.13/5.46  % Version: 3.5.1
% 0.13/5.46  % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.13/5.46  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/5.46  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.13/5.46  % Starting new_bool_3 with 300s (1) cores
% 0.13/5.46  % Starting new_bool_1 with 300s (1) cores
% 0.13/5.46  % Starting sh5l with 300s (1) cores
% 0.13/5.46  % new_bool_3 with pid 4189143 completed with status 0
% 0.13/5.46  % Result found by new_bool_3
% 0.13/5.46  % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.13/5.46  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/5.46  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.13/5.46  % Starting new_bool_3 with 300s (1) cores
% 0.13/5.46  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.13/5.46  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.13/5.46  % Search class: FGHSM-FFMF00-SFFFFFNN
% 0.13/5.46  % partial match(2): FGHSM-FFMF21-SFFFFFNN
% 0.13/5.46  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.13/5.46  % Starting SubtermCWHack with 31s (1) cores
% 0.13/5.46  % SubtermCWHack with pid 4189151 completed with status 0
% 0.13/5.46  % Result found by SubtermCWHack
% 0.13/5.46  % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.13/5.46  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/5.46  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.13/5.46  % Starting new_bool_3 with 300s (1) cores
% 0.13/5.46  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.13/5.46  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.13/5.46  % Search class: FGHSM-FFMF00-SFFFFFNN
% 0.13/5.46  % partial match(2): FGHSM-FFMF21-SFFFFFNN
% 0.13/5.46  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.13/5.46  % Starting SubtermCWHack with 31s (1) cores
% 0.13/5.46  % Preprocessing time       : 0.002 s
% 0.13/5.46  
% 0.13/5.46  % Proof found!
% 0.13/5.46  % SZS status Unsatisfiable
% 0.13/5.46  % SZS output start CNFRefutation
% See solution above
% 0.13/5.46  % Parsed axioms                        : 107
% 0.13/5.46  % Removed by relevancy pruning/SinE    : 39
% 0.13/5.46  % Initial clauses                      : 68
% 0.13/5.46  % Removed in clause preprocessing      : 1
% 0.13/5.46  % Initial clauses in saturation        : 67
% 0.13/5.46  % Processed clauses                    : 178
% 0.13/5.46  % ...of these trivial                  : 15
% 0.13/5.46  % ...subsumed                          : 40
% 0.13/5.46  % ...remaining for further processing  : 123
% 0.13/5.46  % Other redundant clauses eliminated   : 2
% 0.13/5.46  % Clauses deleted for lack of memory   : 0
% 0.13/5.46  % Backward-subsumed                    : 36
% 0.13/5.46  % Backward-rewritten                   : 7
% 0.13/5.46  % Generated clauses                    : 373
% 0.13/5.46  % ...of the previous two non-redundant : 236
% 0.13/5.46  % ...aggressively subsumed             : 0
% 0.13/5.46  % Contextual simplify-reflections      : 0
% 0.13/5.46  % Paramodulations                      : 371
% 0.13/5.46  % Factorizations                       : 0
% 0.13/5.46  % NegExts                              : 0
% 0.13/5.46  % Equation resolutions                 : 2
% 0.13/5.46  % Disequality decompositions           : 0
% 0.13/5.46  % Total rewrite steps                  : 158
% 0.13/5.46  % ...of those cached                   : 120
% 0.13/5.46  % Propositional unsat checks           : 0
% 0.13/5.46  %    Propositional check models        : 0
% 0.13/5.46  %    Propositional check unsatisfiable : 0
% 0.13/5.46  %    Propositional clauses             : 0
% 0.13/5.46  %    Propositional clauses after purity: 0
% 0.13/5.46  %    Propositional unsat core size     : 0
% 0.13/5.46  %    Propositional preprocessing time  : 0.000
% 0.13/5.46  %    Propositional encoding time       : 0.000
% 0.13/5.46  %    Propositional solver time         : 0.000
% 0.13/5.46  %    Success case prop preproc time    : 0.000
% 0.13/5.46  %    Success case prop encoding time   : 0.000
% 0.13/5.46  %    Success case prop solver time     : 0.000
% 0.13/5.46  % Current number of processed clauses  : 78
% 0.13/5.46  %    Positive orientable unit clauses  : 27
% 0.13/5.46  %    Positive unorientable unit clauses: 0
% 0.13/5.46  %    Negative unit clauses             : 8
% 0.13/5.46  %    Non-unit-clauses                  : 43
% 0.13/5.46  % Current number of unprocessed clauses: 124
% 0.13/5.46  % ...number of literals in the above   : 398
% 0.13/5.46  % Current number of archived formulas  : 0
% 0.13/5.46  % Current number of archived clauses   : 43
% 0.13/5.46  % Clause-clause subsumption calls (NU) : 2137
% 0.13/5.46  % Rec. Clause-clause subsumption calls : 2067
% 0.13/5.46  % Non-unit clause-clause subsumptions  : 34
% 0.13/5.46  % Unit Clause-clause subsumption calls : 142
% 0.13/5.46  % Rewrite failures with RHS unbound    : 0
% 0.13/5.46  % BW rewrite match attempts            : 22
% 0.13/5.46  % BW rewrite match successes           : 1
% 0.13/5.46  % Condensation attempts                : 0
% 0.13/5.46  % Condensation successes               : 0
% 0.13/5.46  % Termbank termtop insertions          : 5458
% 0.13/5.46  % Search garbage collected termcells   : 326
% 0.13/5.46  
% 0.13/5.46  % -------------------------------------------------
% 0.13/5.46  % User time                : 0.007 s
% 0.13/5.46  % System time              : 0.006 s
% 0.13/5.46  % Total time               : 0.013 s
% 0.13/5.46  % Maximum resident set size: 3712 pages
% 0.13/5.46  
% 0.13/5.46  % -------------------------------------------------
% 0.13/5.46  % User time                : 0.012 s
% 0.13/5.46  % System time              : 0.009 s
% 0.13/5.46  % Total time               : 0.021 s
% 0.13/5.46  % Maximum resident set size: 4608 pages
% 0.13/5.46  % E exiting
%------------------------------------------------------------------------------