↑ Up

E---3.5.1.UNS-CRf.s

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

% Computer : n006.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.08s 0.45s
% Output   : CNFRefutation 0.08s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    8
% Syntax   : Number of clauses     :   26 (  17 unt;   4 nHn;  20 RR)
%            Number of literals    :   49 (  13 equ;  25 neg)
%            Maximal clause size   :    5 (   1 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-4 aty)
%            Number of functors    :    5 (   5 usr;   4 con; 0-4 aty)
%            Number of variables   :   52 (  10 sgn)

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

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

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

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

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

cnf(w_between_v_and_x,hypothesis,
    between(v,w,x),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',w_between_v_and_x) ).

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

cnf(prove_w_between_u_and_x,negated_conjecture,
    ~ between(u,w,x),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_w_between_u_and_x) ).

cnf(c_0_8,plain,
    ( ~ equidistant(X2,X3,X2,X4)
    | ~ between(X1,X2,X4)
    | ~ between(X1,X2,X3)
    | X3 = X4
    | X1 = X2 ),
    inference(fof_simplification,[status(thm)],[d9]) ).

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

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

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

cnf(c_0_12,hypothesis,
    v != w,
    inference(fof_simplification,[status(thm)],[v_not_w]) ).

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

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

cnf(c_0_15,plain,
    ( ~ between(X4,X2,X3)
    | ~ between(X4,X2,extension(X1,X2,X2,X3))
    | X4 = X2
    | extension(X1,X2,X2,X3) = X3 ),
    inference(spm,[status(thm)],[c_0_10,c_0_11]) ).

cnf(c_0_16,hypothesis,
    between(v,w,x),
    w_between_v_and_x ).

cnf(c_0_17,hypothesis,
    v != w,
    c_0_12 ).

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

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

cnf(c_0_20,hypothesis,
    ( ~ between(v,w,extension(X1,w,w,x))
    | extension(X1,w,w,x) = x ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]) ).

cnf(c_0_21,hypothesis,
    between(v,w,extension(u,w,X1,X2)),
    inference(spm,[status(thm)],[c_0_18,c_0_19]) ).

cnf(c_0_22,negated_conjecture,
    ~ between(u,w,x),
    inference(fof_simplification,[status(thm)],[prove_w_between_u_and_x]) ).

cnf(c_0_23,hypothesis,
    extension(u,w,w,x) = x,
    inference(spm,[status(thm)],[c_0_20,c_0_21]) ).

cnf(c_0_24,negated_conjecture,
    ~ between(u,w,x),
    c_0_22 ).

cnf(c_0_25,hypothesis,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_23]),c_0_24]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : GEO044-3 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.36  % Computer : n006.cluster.edu
% 0.08/0.36  % Model    : x86_64 x86_64
% 0.08/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.36  % Memory   : 8046.5625MB
% 0.08/0.36  % OS       : Linux 6.8.0-71-generic
% 0.08/0.36  % CPULimit : 300
% 0.08/0.36  % WCLimit  : 300
% 0.08/0.36  % DateTime : Sun Sep 20 08:37:29 UTC 2026
% 0.08/0.37  % CPUTime  : 
% 0.08/0.37  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.41  Running first-order theorem proving
% 0.08/0.41  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.08/0.45  % Version: 3.5.1
% 0.08/0.45  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.08/0.45  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.45  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.08/0.45  % Starting new_bool_3 with 300s (1) cores
% 0.08/0.45  % Starting new_bool_1 with 300s (1) cores
% 0.08/0.45  % Starting sh5l with 300s (1) cores
% 0.08/0.45  % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 356295 completed with status 0
% 0.08/0.45  % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.08/0.45  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.08/0.45  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.45  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.08/0.45  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.08/0.45  % No SInE strategy applied
% 0.08/0.45  % Search class: FGUSM-FFMF33-SFFFFFNN
% 0.08/0.45  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.08/0.45  % Starting SubtermCWHack with 136s (1) cores
% 0.08/0.45  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.08/0.45  % Starting G-E--_207_C18_F1_AE_CS_SP_PI_S0a with 136s (1) cores
% 0.08/0.45  % Starting new_bool_3 with 136s (1) cores
% 0.08/0.45  % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S070I with 136s (1) cores
% 0.08/0.45  % new_bool_3 with pid 356305 completed with status 0
% 0.08/0.45  % Result found by new_bool_3
% 0.08/0.45  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.08/0.45  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.45  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.08/0.45  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.08/0.45  % No SInE strategy applied
% 0.08/0.45  % Search class: FGUSM-FFMF33-SFFFFFNN
% 0.08/0.45  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.08/0.45  % Starting SubtermCWHack with 136s (1) cores
% 0.08/0.45  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.08/0.45  % Starting G-E--_207_C18_F1_AE_CS_SP_PI_S0a with 136s (1) cores
% 0.08/0.45  % Starting new_bool_3 with 136s (1) cores
% 0.08/0.45  % Preprocessing time       : 0.002 s
% 0.08/0.45  % Presaturation interreduction done
% 0.08/0.45  
% 0.08/0.45  % Proof found!
% 0.08/0.45  % SZS status Unsatisfiable
% 0.08/0.45  % SZS output start CNFRefutation
% See solution above
% 0.08/0.45  % Parsed axioms                        : 57
% 0.08/0.45  % Removed by relevancy pruning/SinE    : 0
% 0.08/0.45  % Initial clauses                      : 57
% 0.08/0.45  % Removed in clause preprocessing      : 2
% 0.08/0.45  % Initial clauses in saturation        : 55
% 0.08/0.45  % Processed clauses                    : 288
% 0.08/0.45  % ...of these trivial                  : 13
% 0.08/0.45  % ...subsumed                          : 79
% 0.08/0.45  % ...remaining for further processing  : 196
% 0.08/0.45  % Other redundant clauses eliminated   : 4
% 0.08/0.45  % Clauses deleted for lack of memory   : 0
% 0.08/0.45  % Backward-subsumed                    : 0
% 0.08/0.45  % Backward-rewritten                   : 0
% 0.08/0.45  % Generated clauses                    : 906
% 0.08/0.45  % ...of the previous two non-redundant : 607
% 0.08/0.45  % ...aggressively subsumed             : 0
% 0.08/0.45  % Contextual simplify-reflections      : 0
% 0.08/0.45  % Paramodulations                      : 902
% 0.08/0.45  % Factorizations                       : 0
% 0.08/0.45  % NegExts                              : 0
% 0.08/0.45  % Equation resolutions                 : 4
% 0.08/0.45  % Disequality decompositions           : 0
% 0.08/0.45  % Total rewrite steps                  : 303
% 0.08/0.45  % ...of those cached                   : 185
% 0.08/0.45  % Propositional unsat checks           : 0
% 0.08/0.45  %    Propositional check models        : 0
% 0.08/0.45  %    Propositional check unsatisfiable : 0
% 0.08/0.45  %    Propositional clauses             : 0
% 0.08/0.45  %    Propositional clauses after purity: 0
% 0.08/0.45  %    Propositional unsat core size     : 0
% 0.08/0.45  %    Propositional preprocessing time  : 0.000
% 0.08/0.45  %    Propositional encoding time       : 0.000
% 0.08/0.45  %    Propositional solver time         : 0.000
% 0.08/0.45  %    Success case prop preproc time    : 0.000
% 0.08/0.45  %    Success case prop encoding time   : 0.000
% 0.08/0.45  %    Success case prop solver time     : 0.000
% 0.08/0.45  % Current number of processed clauses  : 146
% 0.08/0.45  %    Positive orientable unit clauses  : 50
% 0.08/0.45  %    Positive unorientable unit clauses: 0
% 0.08/0.45  %    Negative unit clauses             : 15
% 0.08/0.45  %    Non-unit-clauses                  : 81
% 0.08/0.45  % Current number of unprocessed clauses: 421
% 0.08/0.45  % ...number of literals in the above   : 1033
% 0.08/0.45  % Current number of archived formulas  : 0
% 0.08/0.45  % Current number of archived clauses   : 48
% 0.08/0.45  % Clause-clause subsumption calls (NU) : 2718
% 0.08/0.45  % Rec. Clause-clause subsumption calls : 2052
% 0.08/0.45  % Non-unit clause-clause subsumptions  : 60
% 0.08/0.45  % Unit Clause-clause subsumption calls : 207
% 0.08/0.45  % Rewrite failures with RHS unbound    : 0
% 0.08/0.45  % BW rewrite match attempts            : 230
% 0.08/0.45  % BW rewrite match successes           : 0
% 0.08/0.45  % Condensation attempts                : 0
% 0.08/0.45  % Condensation successes               : 0
% 0.08/0.45  % Termbank termtop insertions          : 12195
% 0.08/0.45  % Search garbage collected termcells   : 127
% 0.08/0.45  
% 0.08/0.45  % -------------------------------------------------
% 0.08/0.45  % User time                : 0.022 s
% 0.08/0.45  % System time              : 0.007 s
% 0.08/0.45  % Total time               : 0.029 s
% 0.08/0.45  % Maximum resident set size: 3676 pages
% 0.08/0.45  
% 0.08/0.45  % -------------------------------------------------
% 0.08/0.45  % User time                : 0.122 s
% 0.08/0.45  % System time              : 0.016 s
% 0.08/0.45  % Total time               : 0.138 s
% 0.08/0.45  % Maximum resident set size: 4608 pages
% 0.08/0.45  % E exiting
%------------------------------------------------------------------------------