↑ Up

E---3.5.1.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : GEO052-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 : 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:27:01 PM UTC 2026

% Result   : Unsatisfiable 0.19s 0.56s
% Output   : CNFRefutation 0.37s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    8
% Syntax   : Number of clauses     :   28 (  16 unt;   5 nHn;  26 RR)
%            Number of literals    :   50 (   0 equ;  23 neg)
%            Maximal clause size   :    4 (   1 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-3 aty)
%            Number of functors    :    4 (   4 usr;   4 con; 0-0 aty)
%            Number of variables   :   39 (   2 sgn)

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

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

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

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

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

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

cnf(w_not_between_v_and_x,hypothesis,
    ~ between(v,w,x),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',w_not_between_v_and_x) ).

cnf(prove_v_between_w_and_x,negated_conjecture,
    ~ between(w,v,x),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_v_between_w_and_x) ).

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

cnf(c_0_9,plain,
    ( ~ between(X1,X4,X3)
    | ~ between(X1,X2,X3)
    | between(X1,X4,X2)
    | between(X1,X2,X4) ),
    inference(fof_simplification,[status(thm)],[t9]) ).

cnf(c_0_10,plain,
    ( ~ between(X1,X2,X3)
    | between(X3,X2,X1) ),
    c_0_8 ).

cnf(c_0_11,hypothesis,
    between(u,w,x),
    w_between_u_and_x ).

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

cnf(c_0_13,hypothesis,
    between(u,v,x),
    v_between_u_and_x ).

cnf(c_0_14,plain,
    ( ~ between(X1,X4,X3)
    | ~ between(X1,X2,X3)
    | between(X1,X4,X2)
    | between(X1,X2,X4) ),
    c_0_9 ).

cnf(c_0_15,hypothesis,
    between(x,w,u),
    inference(spm,[status(thm)],[c_0_10,c_0_11]) ).

cnf(c_0_16,plain,
    ( ~ between(X2,X4,X3)
    | ~ between(X1,X2,X3)
    | between(X1,X4,X3) ),
    c_0_12 ).

cnf(c_0_17,hypothesis,
    between(x,v,u),
    inference(spm,[status(thm)],[c_0_10,c_0_13]) ).

cnf(c_0_18,hypothesis,
    ( ~ between(x,X1,u)
    | between(x,X1,w)
    | between(x,w,X1) ),
    inference(spm,[status(thm)],[c_0_14,c_0_15]) ).

cnf(c_0_19,hypothesis,
    ( ~ between(X1,x,u)
    | between(X1,v,u) ),
    inference(spm,[status(thm)],[c_0_16,c_0_17]) ).

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

cnf(c_0_21,hypothesis,
    ~ between(v,w,x),
    inference(fof_simplification,[status(thm)],[w_not_between_v_and_x]) ).

cnf(c_0_22,hypothesis,
    ( between(x,w,v)
    | between(x,v,w) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20])]) ).

cnf(c_0_23,hypothesis,
    ~ between(v,w,x),
    c_0_21 ).

cnf(c_0_24,negated_conjecture,
    ~ between(w,v,x),
    inference(fof_simplification,[status(thm)],[prove_v_between_w_and_x]) ).

cnf(c_0_25,hypothesis,
    between(x,v,w),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_22]),c_0_23]) ).

cnf(c_0_26,negated_conjecture,
    ~ between(w,v,x),
    c_0_24 ).

cnf(c_0_27,hypothesis,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_25]),c_0_26]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : GEO052-3 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.44  % Computer : n019.cluster.edu
% 0.14/0.44  % Model    : x86_64 x86_64
% 0.14/0.44  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.44  % Memory   : 8046.5625MB
% 0.14/0.44  % OS       : Linux 6.8.0-71-generic
% 0.14/0.44  % CPULimit : 300
% 0.14/0.44  % WCLimit  : 300
% 0.14/0.44  % DateTime : Sun Sep 20 08:46:35 UTC 2026
% 0.14/0.44  % CPUTime  : 
% 0.14/0.44  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.19/0.48  Running first-order theorem proving
% 0.19/0.49  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.19/0.56  % Version: 3.5.1
% 0.19/0.56  % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.19/0.56  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.56  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.19/0.56  % Starting new_bool_3 with 300s (1) cores
% 0.19/0.56  % Starting new_bool_1 with 300s (1) cores
% 0.19/0.56  % Starting sh5l with 300s (1) cores
% 0.19/0.56  % new_bool_1 with pid 4152328 completed with status 0
% 0.19/0.56  % Result found by new_bool_1
% 0.19/0.56  % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.19/0.56  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.56  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.19/0.56  % Starting new_bool_3 with 300s (1) cores
% 0.19/0.56  % Starting new_bool_1 with 300s (1) cores
% 0.19/0.56  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.19/0.56  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.56  % Search class: FGUSS-FFMF00-SFFFFFNN
% 0.19/0.56  % partial match(2): FGUSS-FFMF33-SFFFFFNN
% 0.19/0.56  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.56  % Starting SubtermCWHack with 28s (1) cores
% 0.19/0.56  % SubtermCWHack with pid 4152336 completed with status 0
% 0.19/0.56  % Result found by SubtermCWHack
% 0.19/0.56  % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.19/0.56  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.56  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.19/0.56  % Starting new_bool_3 with 300s (1) cores
% 0.19/0.56  % Starting new_bool_1 with 300s (1) cores
% 0.19/0.56  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.19/0.56  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.56  % Search class: FGUSS-FFMF00-SFFFFFNN
% 0.19/0.56  % partial match(2): FGUSS-FFMF33-SFFFFFNN
% 0.19/0.56  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.56  % Starting SubtermCWHack with 28s (1) cores
% 0.19/0.56  % Preprocessing time       : 0.002 s
% 0.19/0.56  
% 0.19/0.56  % Proof found!
% 0.19/0.56  % SZS status Unsatisfiable
% 0.19/0.56  % SZS output start CNFRefutation
% See solution above
% 0.37/0.56  % Parsed axioms                        : 84
% 0.37/0.56  % Removed by relevancy pruning/SinE    : 61
% 0.37/0.56  % Initial clauses                      : 23
% 0.37/0.56  % Removed in clause preprocessing      : 1
% 0.37/0.56  % Initial clauses in saturation        : 22
% 0.37/0.56  % Processed clauses                    : 188
% 0.37/0.56  % ...of these trivial                  : 0
% 0.37/0.56  % ...subsumed                          : 80
% 0.37/0.56  % ...remaining for further processing  : 108
% 0.37/0.56  % Other redundant clauses eliminated   : 1
% 0.37/0.56  % Clauses deleted for lack of memory   : 0
% 0.37/0.56  % Backward-subsumed                    : 7
% 0.37/0.56  % Backward-rewritten                   : 1
% 0.37/0.56  % Generated clauses                    : 443
% 0.37/0.56  % ...of the previous two non-redundant : 339
% 0.37/0.56  % ...aggressively subsumed             : 0
% 0.37/0.56  % Contextual simplify-reflections      : 0
% 0.37/0.56  % Paramodulations                      : 442
% 0.37/0.56  % Factorizations                       : 0
% 0.37/0.56  % NegExts                              : 0
% 0.37/0.56  % Equation resolutions                 : 1
% 0.37/0.56  % Disequality decompositions           : 0
% 0.37/0.56  % Total rewrite steps                  : 135
% 0.37/0.56  % ...of those cached                   : 111
% 0.37/0.56  % Propositional unsat checks           : 0
% 0.37/0.56  %    Propositional check models        : 0
% 0.37/0.56  %    Propositional check unsatisfiable : 0
% 0.37/0.56  %    Propositional clauses             : 0
% 0.37/0.56  %    Propositional clauses after purity: 0
% 0.37/0.56  %    Propositional unsat core size     : 0
% 0.37/0.56  %    Propositional preprocessing time  : 0.000
% 0.37/0.56  %    Propositional encoding time       : 0.000
% 0.37/0.56  %    Propositional solver time         : 0.000
% 0.37/0.56  %    Success case prop preproc time    : 0.000
% 0.37/0.56  %    Success case prop encoding time   : 0.000
% 0.37/0.56  %    Success case prop solver time     : 0.000
% 0.37/0.56  % Current number of processed clauses  : 99
% 0.37/0.56  %    Positive orientable unit clauses  : 7
% 0.37/0.56  %    Positive unorientable unit clauses: 0
% 0.37/0.56  %    Negative unit clauses             : 3
% 0.37/0.56  %    Non-unit-clauses                  : 89
% 0.37/0.56  % Current number of unprocessed clauses: 156
% 0.37/0.56  % ...number of literals in the above   : 657
% 0.37/0.56  % Current number of archived formulas  : 0
% 0.37/0.56  % Current number of archived clauses   : 8
% 0.37/0.56  % Clause-clause subsumption calls (NU) : 2198
% 0.37/0.56  % Rec. Clause-clause subsumption calls : 2045
% 0.37/0.56  % Non-unit clause-clause subsumptions  : 75
% 0.37/0.56  % Unit Clause-clause subsumption calls : 10
% 0.37/0.56  % Rewrite failures with RHS unbound    : 0
% 0.37/0.56  % BW rewrite match attempts            : 7
% 0.37/0.56  % BW rewrite match successes           : 1
% 0.37/0.56  % Condensation attempts                : 0
% 0.37/0.56  % Condensation successes               : 0
% 0.37/0.56  % Termbank termtop insertions          : 6733
% 0.37/0.56  % Search garbage collected termcells   : 335
% 0.37/0.56  
% 0.37/0.56  % -------------------------------------------------
% 0.37/0.56  % User time                : 0.021 s
% 0.37/0.56  % System time              : 0.003 s
% 0.37/0.56  % Total time               : 0.024 s
% 0.37/0.56  % Maximum resident set size: 3700 pages
% 0.37/0.56  
% 0.37/0.56  % -------------------------------------------------
% 0.37/0.56  % User time                : 0.024 s
% 0.37/0.56  % System time              : 0.008 s
% 0.37/0.56  % Total time               : 0.032 s
% 0.37/0.56  % Maximum resident set size: 4864 pages
% 0.37/0.56  % E exiting
%------------------------------------------------------------------------------