↑ 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  : GEO067-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 : n013.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.21s 10.82s
% Output   : CNFRefutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    7
% Syntax   : Number of clauses     :   25 (   5 unt;   0 nHn;  23 RR)
%            Number of literals    :   57 (   5 equ;  37 neg)
%            Maximal clause size   :    4 (   2 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-3 aty)
%            Number of functors    :    3 (   3 usr;   3 con; 0-0 aty)
%            Number of variables   :   40 (   2 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(part_1,negated_conjecture,
    ( ~ colinear(y,x,x)
    | ~ colinear(x,y,x)
    | ~ colinear(x,x,y)
    | x = y ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',part_1) ).

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

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

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

cnf(part_2,negated_conjecture,
    ( ~ colinear(x,z,y)
    | ~ colinear(y,x,x)
    | ~ colinear(x,y,x)
    | ~ colinear(x,x,y) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',part_2) ).

cnf(t2,axiom,
    between(X1,X1,X2),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t2) ).

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

cnf(c_0_7,negated_conjecture,
    ( ~ colinear(y,x,x)
    | ~ colinear(x,y,x)
    | ~ colinear(x,x,y)
    | x = y ),
    inference(fof_simplification,[status(thm)],[part_1]) ).

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

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

cnf(c_0_10,negated_conjecture,
    ( ~ colinear(y,x,x)
    | ~ colinear(x,y,x)
    | ~ colinear(x,x,y)
    | x = y ),
    c_0_7 ).

cnf(c_0_11,plain,
    ( ~ colinear(X1,X2,X3)
    | colinear(X2,X3,X1) ),
    c_0_8 ).

cnf(c_0_12,plain,
    ( ~ colinear(X1,X2,X3)
    | colinear(X1,X3,X2) ),
    c_0_9 ).

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

cnf(c_0_14,negated_conjecture,
    ( ~ colinear(x,z,y)
    | ~ colinear(y,x,x)
    | ~ colinear(x,y,x)
    | ~ colinear(x,x,y) ),
    inference(fof_simplification,[status(thm)],[part_2]) ).

cnf(c_0_15,negated_conjecture,
    ( ~ colinear(x,x,y)
    | y = x ),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_10,c_0_11]),c_0_12]) ).

cnf(c_0_16,plain,
    ( ~ between(X1,X2,X3)
    | colinear(X1,X2,X3) ),
    c_0_13 ).

cnf(c_0_17,axiom,
    between(X1,X1,X2),
    t2 ).

cnf(c_0_18,negated_conjecture,
    ( ~ colinear(x,z,y)
    | ~ colinear(y,x,x)
    | ~ colinear(x,y,x)
    | ~ colinear(x,x,y) ),
    c_0_14 ).

cnf(c_0_19,negated_conjecture,
    y = x,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17])]) ).

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

cnf(c_0_21,negated_conjecture,
    ( ~ colinear(x,z,x)
    | ~ colinear(x,x,x) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_19]),c_0_19]),c_0_19]),c_0_19])]) ).

cnf(c_0_22,plain,
    ( ~ between(X1,X2,X3)
    | colinear(X2,X3,X1) ),
    c_0_20 ).

cnf(c_0_23,negated_conjecture,
    ~ colinear(x,x,x),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_17])]) ).

cnf(c_0_24,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_16]),c_0_17])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04  % Problem  : GEO067-3 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.07  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.17/10.66  % Computer : n013.cluster.edu
% 0.17/10.66  % Model    : x86_64 x86_64
% 0.17/10.66  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/10.66  % Memory   : 8046.5625MB
% 0.17/10.66  % OS       : Linux 6.8.0-71-generic
% 0.17/10.66  % CPULimit : 300
% 0.17/10.66  % WCLimit  : 300
% 0.17/10.66  % DateTime : Sun Sep 20 09:28:57 UTC 2026
% 0.17/10.66  % CPUTime  : 
% 0.17/10.67  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.21/10.74  Running first-order theorem proving
% 0.21/10.74  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.21/10.82  % Version: 3.5.1
% 0.21/10.82  % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/10.82  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/10.82  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/10.82  % Starting new_bool_3 with 300s (1) cores
% 0.21/10.82  % Starting new_bool_1 with 300s (1) cores
% 0.21/10.82  % Starting sh5l with 300s (1) cores
% 0.21/10.82  % new_bool_3 with pid 2549095 completed with status 0
% 0.21/10.82  % Result found by new_bool_3
% 0.21/10.82  % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/10.82  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/10.82  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/10.82  % Starting new_bool_3 with 300s (1) cores
% 0.21/10.82  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.21/10.82  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/10.82  % Search class: FGHSS-FFMF00-SFFFFFNN
% 0.21/10.82  % partial match(2): FGHSS-FFMF32-SFFFFFNN
% 0.21/10.82  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/10.82  % Starting SubtermCWHack with 31s (1) cores
% 0.21/10.82  % SubtermCWHack with pid 2549099 completed with status 0
% 0.21/10.82  % Result found by SubtermCWHack
% 0.21/10.82  % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/10.82  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/10.82  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/10.82  % Starting new_bool_3 with 300s (1) cores
% 0.21/10.82  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.21/10.82  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/10.82  % Search class: FGHSS-FFMF00-SFFFFFNN
% 0.21/10.82  % partial match(2): FGHSS-FFMF32-SFFFFFNN
% 0.21/10.82  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/10.82  % Starting SubtermCWHack with 31s (1) cores
% 0.21/10.82  % Preprocessing time       : 0.002 s
% 0.21/10.82  
% 0.21/10.82  % Proof found!
% 0.21/10.82  % SZS status Unsatisfiable
% 0.21/10.82  % SZS output start CNFRefutation
% See solution above
% 0.21/10.82  % Parsed axioms                        : 98
% 0.21/10.82  % Removed by relevancy pruning/SinE    : 63
% 0.21/10.82  % Initial clauses                      : 35
% 0.21/10.82  % Removed in clause preprocessing      : 1
% 0.21/10.82  % Initial clauses in saturation        : 34
% 0.21/10.82  % Processed clauses                    : 69
% 0.21/10.82  % ...of these trivial                  : 0
% 0.21/10.82  % ...subsumed                          : 34
% 0.21/10.82  % ...remaining for further processing  : 35
% 0.21/10.82  % Other redundant clauses eliminated   : 1
% 0.21/10.82  % Clauses deleted for lack of memory   : 0
% 0.21/10.82  % Backward-subsumed                    : 1
% 0.21/10.82  % Backward-rewritten                   : 1
% 0.21/10.82  % Generated clauses                    : 80
% 0.21/10.82  % ...of the previous two non-redundant : 50
% 0.21/10.82  % ...aggressively subsumed             : 0
% 0.21/10.82  % Contextual simplify-reflections      : 2
% 0.21/10.82  % Paramodulations                      : 79
% 0.21/10.82  % Factorizations                       : 0
% 0.21/10.82  % NegExts                              : 0
% 0.21/10.82  % Equation resolutions                 : 1
% 0.21/10.82  % Disequality decompositions           : 0
% 0.21/10.82  % Total rewrite steps                  : 29
% 0.21/10.82  % ...of those cached                   : 19
% 0.21/10.82  % Propositional unsat checks           : 0
% 0.21/10.82  %    Propositional check models        : 0
% 0.21/10.82  %    Propositional check unsatisfiable : 0
% 0.21/10.82  %    Propositional clauses             : 0
% 0.21/10.82  %    Propositional clauses after purity: 0
% 0.21/10.82  %    Propositional unsat core size     : 0
% 0.21/10.82  %    Propositional preprocessing time  : 0.000
% 0.21/10.82  %    Propositional encoding time       : 0.000
% 0.21/10.82  %    Propositional solver time         : 0.000
% 0.21/10.82  %    Success case prop preproc time    : 0.000
% 0.21/10.82  %    Success case prop encoding time   : 0.000
% 0.21/10.82  %    Success case prop solver time     : 0.000
% 0.21/10.82  % Current number of processed clauses  : 32
% 0.21/10.82  %    Positive orientable unit clauses  : 3
% 0.21/10.82  %    Positive unorientable unit clauses: 0
% 0.21/10.82  %    Negative unit clauses             : 1
% 0.21/10.82  %    Non-unit-clauses                  : 28
% 0.21/10.82  % Current number of unprocessed clauses: 10
% 0.21/10.82  % ...number of literals in the above   : 29
% 0.21/10.82  % Current number of archived formulas  : 0
% 0.21/10.82  % Current number of archived clauses   : 2
% 0.21/10.82  % Clause-clause subsumption calls (NU) : 575
% 0.21/10.82  % Rec. Clause-clause subsumption calls : 471
% 0.21/10.82  % Non-unit clause-clause subsumptions  : 36
% 0.21/10.82  % Unit Clause-clause subsumption calls : 1
% 0.21/10.82  % Rewrite failures with RHS unbound    : 0
% 0.21/10.82  % BW rewrite match attempts            : 2
% 0.21/10.82  % BW rewrite match successes           : 1
% 0.21/10.82  % Condensation attempts                : 0
% 0.21/10.82  % Condensation successes               : 0
% 0.21/10.82  % Termbank termtop insertions          : 2174
% 0.21/10.82  % Search garbage collected termcells   : 367
% 0.21/10.82  
% 0.21/10.82  % -------------------------------------------------
% 0.21/10.82  % User time                : 0.007 s
% 0.21/10.82  % System time              : 0.004 s
% 0.21/10.82  % Total time               : 0.010 s
% 0.21/10.82  % Maximum resident set size: 3708 pages
% 0.21/10.82  
% 0.21/10.82  % -------------------------------------------------
% 0.21/10.82  % User time                : 0.011 s
% 0.21/10.82  % System time              : 0.012 s
% 0.21/10.82  % Total time               : 0.023 s
% 0.21/10.82  % Maximum resident set size: 4864 pages
% 0.21/10.82  % E exiting
%------------------------------------------------------------------------------