↑ Up

E---3.5.1.UNS-CRf.s

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

% Result   : Unsatisfiable 0.15s 5.53s
% Output   : CNFRefutation 0.15s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :   10
% Syntax   : Number of clauses     :   33 (  18 unt;   4 nHn;  31 RR)
%            Number of literals    :   83 (  13 equ;  52 neg)
%            Maximal clause size   :    8 (   2 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-4 aty)
%            Number of functors    :    4 (   4 usr;   4 con; 0-0 aty)
%            Number of variables   :   77 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(outer_five_segment,axiom,
    ( ~ between(X3,X4,X6)
    | ~ between(X1,X2,X5)
    | ~ equidistant(X2,X7,X4,X8)
    | ~ equidistant(X1,X7,X3,X8)
    | ~ equidistant(X2,X5,X4,X6)
    | ~ equidistant(X1,X2,X3,X4)
    | equidistant(X5,X7,X6,X8)
    | X1 = X2 ),
    file('/export/starexec/sandbox/benchmark/Axioms/GEO002-0.ax',outer_five_segment) ).

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

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

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

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

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

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

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

cnf(identity_for_equidistance,axiom,
    ( ~ equidistant(X1,X2,X3,X3)
    | X1 = X2 ),
    file('/export/starexec/sandbox/benchmark/Axioms/GEO002-0.ax',identity_for_equidistance) ).

cnf(prove_w_is_x,negated_conjecture,
    w != x,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_w_is_x) ).

cnf(c_0_10,plain,
    ( ~ between(X3,X4,X6)
    | ~ between(X1,X2,X5)
    | ~ equidistant(X2,X7,X4,X8)
    | ~ equidistant(X1,X7,X3,X8)
    | ~ equidistant(X2,X5,X4,X6)
    | ~ equidistant(X1,X2,X3,X4)
    | equidistant(X5,X7,X6,X8)
    | X1 = X2 ),
    inference(fof_simplification,[status(thm)],[outer_five_segment]) ).

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

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

cnf(c_0_13,plain,
    ( ~ between(X3,X4,X6)
    | ~ between(X1,X2,X5)
    | ~ equidistant(X2,X7,X4,X8)
    | ~ equidistant(X1,X7,X3,X8)
    | ~ equidistant(X2,X5,X4,X6)
    | ~ equidistant(X1,X2,X3,X4)
    | equidistant(X5,X7,X6,X8)
    | X1 = X2 ),
    c_0_10 ).

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

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

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

cnf(c_0_17,plain,
    ( ~ equidistant(X1,X2,X3,X4)
    | equidistant(X3,X4,X1,X2) ),
    c_0_12 ).

cnf(c_0_18,hypothesis,
    equidistant(v,w,v,x),
    v_to_w_equals_v_to_x ).

cnf(c_0_19,hypothesis,
    ( ~ equidistant(X1,X4,u,X5)
    | ~ equidistant(X2,X4,v,X5)
    | ~ equidistant(X1,X2,u,v)
    | ~ equidistant(X2,X3,v,w)
    | ~ between(X1,X2,X3)
    | equidistant(X3,X4,w,X5)
    | X1 = X2 ),
    inference(spm,[status(thm)],[c_0_13,c_0_14]) ).

cnf(c_0_20,axiom,
    equidistant(X1,X2,X1,X2),
    d1 ).

cnf(c_0_21,hypothesis,
    u != v,
    c_0_15 ).

cnf(c_0_22,hypothesis,
    ( ~ equidistant(X1,X3,u,v)
    | ~ equidistant(X3,X2,v,w)
    | ~ between(X1,X3,X2)
    | equidistant(X1,X2,u,w) ),
    inference(spm,[status(thm)],[c_0_16,c_0_14]) ).

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

cnf(c_0_24,hypothesis,
    equidistant(v,x,v,w),
    inference(spm,[status(thm)],[c_0_17,c_0_18]) ).

cnf(c_0_25,plain,
    ( ~ equidistant(X1,X2,X3,X3)
    | X1 = X2 ),
    inference(fof_simplification,[status(thm)],[identity_for_equidistance]) ).

cnf(c_0_26,hypothesis,
    ( ~ equidistant(u,X1,u,X2)
    | ~ equidistant(v,X1,v,X2)
    | equidistant(w,X1,w,X2) ),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_14]),c_0_20]),c_0_20])]),c_0_21]) ).

cnf(c_0_27,hypothesis,
    equidistant(u,x,u,w),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]),c_0_20])]) ).

cnf(c_0_28,negated_conjecture,
    w != x,
    inference(fof_simplification,[status(thm)],[prove_w_is_x]) ).

cnf(c_0_29,plain,
    ( ~ equidistant(X1,X2,X3,X3)
    | X1 = X2 ),
    c_0_25 ).

cnf(c_0_30,hypothesis,
    equidistant(w,x,w,w),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_24]),c_0_27])]) ).

cnf(c_0_31,negated_conjecture,
    w != x,
    c_0_28 ).

cnf(c_0_32,hypothesis,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : GEO026-3 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/5.39  % Computer : n019.cluster.edu
% 0.12/5.39  % Model    : x86_64 x86_64
% 0.12/5.39  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/5.39  % Memory   : 8046.5625MB
% 0.12/5.39  % OS       : Linux 6.8.0-71-generic
% 0.12/5.39  % CPULimit : 300
% 0.12/5.39  % WCLimit  : 300
% 0.12/5.39  % DateTime : Sun Sep 20 08:22:55 UTC 2026
% 0.12/5.40  % CPUTime  : 
% 0.12/5.40  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/5.43  Running first-order theorem proving
% 0.15/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.15/5.53  % Version: 3.5.1
% 0.15/5.53  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/5.53  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.53  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/5.53  % Starting new_bool_3 with 300s (1) cores
% 0.15/5.53  % Starting new_bool_1 with 300s (1) cores
% 0.15/5.53  % Starting sh5l with 300s (1) cores
% 0.15/5.53  % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 4140483 completed with status 0
% 0.15/5.53  % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.15/5.53  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/5.53  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.53  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/5.53  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/5.53  % No SInE strategy applied
% 0.15/5.53  % Search class: FGUSM-FFMS33-SFFFFFNN
% 0.15/5.53  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/5.53  % Starting SubtermCWHack with 136s (1) cores
% 0.15/5.53  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.15/5.53  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (1) cores
% 0.15/5.53  % Starting new_bool_3 with 136s (1) cores
% 0.15/5.53  % Starting new_bool_1 with 136s (1) cores
% 0.15/5.53  % G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with pid 4140491 completed with status 0
% 0.15/5.53  % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d
% 0.15/5.53  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/5.53  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.53  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/5.53  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/5.53  % No SInE strategy applied
% 0.15/5.53  % Search class: FGUSM-FFMS33-SFFFFFNN
% 0.15/5.53  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/5.53  % Starting SubtermCWHack with 136s (1) cores
% 0.15/5.53  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.15/5.53  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (1) cores
% 0.15/5.53  % Preprocessing time       : 0.002 s
% 0.15/5.53  % Presaturation interreduction done
% 0.15/5.53  
% 0.15/5.53  % Proof found!
% 0.15/5.53  % SZS status Unsatisfiable
% 0.15/5.53  % SZS output start CNFRefutation
% See solution above
% 0.15/5.53  % Parsed axioms                        : 42
% 0.15/5.53  % Removed by relevancy pruning/SinE    : 0
% 0.15/5.53  % Initial clauses                      : 42
% 0.15/5.53  % Removed in clause preprocessing      : 1
% 0.15/5.53  % Initial clauses in saturation        : 41
% 0.15/5.53  % Processed clauses                    : 570
% 0.15/5.53  % ...of these trivial                  : 167
% 0.15/5.53  % ...subsumed                          : 13
% 0.15/5.53  % ...remaining for further processing  : 390
% 0.15/5.53  % Other redundant clauses eliminated   : 2
% 0.15/5.53  % Clauses deleted for lack of memory   : 0
% 0.15/5.53  % Backward-subsumed                    : 0
% 0.15/5.53  % Backward-rewritten                   : 0
% 0.15/5.53  % Generated clauses                    : 3837
% 0.15/5.53  % ...of the previous two non-redundant : 3006
% 0.15/5.53  % ...aggressively subsumed             : 0
% 0.15/5.53  % Contextual simplify-reflections      : 0
% 0.15/5.53  % Paramodulations                      : 3835
% 0.15/5.53  % Factorizations                       : 0
% 0.15/5.53  % NegExts                              : 0
% 0.15/5.53  % Equation resolutions                 : 2
% 0.15/5.53  % Disequality decompositions           : 0
% 0.15/5.53  % Total rewrite steps                  : 1025
% 0.15/5.53  % ...of those cached                   : 903
% 0.15/5.53  % Propositional unsat checks           : 0
% 0.15/5.53  %    Propositional check models        : 0
% 0.15/5.53  %    Propositional check unsatisfiable : 0
% 0.15/5.53  %    Propositional clauses             : 0
% 0.15/5.53  %    Propositional clauses after purity: 0
% 0.15/5.53  %    Propositional unsat core size     : 0
% 0.15/5.53  %    Propositional preprocessing time  : 0.000
% 0.15/5.53  %    Propositional encoding time       : 0.000
% 0.15/5.53  %    Propositional solver time         : 0.000
% 0.15/5.53  %    Success case prop preproc time    : 0.000
% 0.15/5.53  %    Success case prop encoding time   : 0.000
% 0.15/5.53  %    Success case prop solver time     : 0.000
% 0.15/5.53  % Current number of processed clauses  : 352
% 0.15/5.53  %    Positive orientable unit clauses  : 100
% 0.15/5.53  %    Positive unorientable unit clauses: 0
% 0.15/5.53  %    Negative unit clauses             : 5
% 0.15/5.53  %    Non-unit-clauses                  : 247
% 0.15/5.53  % Current number of unprocessed clauses: 2506
% 0.15/5.53  % ...number of literals in the above   : 5981
% 0.15/5.53  % Current number of archived formulas  : 0
% 0.15/5.53  % Current number of archived clauses   : 37
% 0.15/5.53  % Clause-clause subsumption calls (NU) : 13206
% 0.15/5.53  % Rec. Clause-clause subsumption calls : 11540
% 0.15/5.53  % Non-unit clause-clause subsumptions  : 13
% 0.15/5.53  % Unit Clause-clause subsumption calls : 100
% 0.15/5.53  % Rewrite failures with RHS unbound    : 0
% 0.15/5.53  % BW rewrite match attempts            : 557
% 0.15/5.53  % BW rewrite match successes           : 0
% 0.15/5.53  % Condensation attempts                : 0
% 0.15/5.53  % Condensation successes               : 0
% 0.15/5.53  % Termbank termtop insertions          : 78642
% 0.15/5.53  % Search garbage collected termcells   : 98
% 0.15/5.53  
% 0.15/5.53  % -------------------------------------------------
% 0.15/5.53  % User time                : 0.072 s
% 0.15/5.53  % System time              : 0.010 s
% 0.15/5.53  % Total time               : 0.082 s
% 0.15/5.53  % Maximum resident set size: 3664 pages
% 0.15/5.53  
% 0.15/5.53  % -------------------------------------------------
% 0.15/5.53  % User time                : 0.301 s
% 0.15/5.53  % System time              : 0.032 s
% 0.15/5.53  % Total time               : 0.333 s
% 0.15/5.53  % Maximum resident set size: 4864 pages
% 0.15/5.53  % E exiting
%------------------------------------------------------------------------------