↑ Up

E---3.5.1.UNS-CRf.s

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

% Computer : n005.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:56 PM UTC 2026

% Result   : Unsatisfiable 10.65s 2.05s
% Output   : CNFRefutation 10.65s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   10
% Syntax   : Number of clauses     :   36 (  21 unt;   5 nHn;  34 RR)
%            Number of literals    :   78 (  14 equ;  43 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   :   69 (   0 sgn)

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

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

cnf(v_to_w_equals_v_to_w1,hypothesis,
    equidistant(v,w,v,w1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',v_to_w_equals_v_to_w1) ).

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/sandbox2/benchmark/Axioms/GEO002-0.ax',outer_five_segment) ).

cnf(u_to_w_equals_u_to_w1,hypothesis,
    equidistant(u,w,u,w1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',u_to_w_equals_u_to_w1) ).

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

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

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

cnf(prove_w_is_w1,negated_conjecture,
    w != w1,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_w_is_w1) ).

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

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

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

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

cnf(c_0_13,hypothesis,
    equidistant(v,w,v,w1),
    v_to_w_equals_v_to_w1 ).

cnf(c_0_14,plain,
    ( ~ equidistant(X1,X2,X3,X4)
    | equidistant(X4,X3,X1,X2) ),
    c_0_11 ).

cnf(c_0_15,hypothesis,
    equidistant(w1,v,w,v),
    inference(spm,[status(thm)],[c_0_12,c_0_13]) ).

cnf(c_0_16,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_17,hypothesis,
    equidistant(v,w,w1,v),
    inference(spm,[status(thm)],[c_0_14,c_0_15]) ).

cnf(c_0_18,hypothesis,
    equidistant(u,w,u,w1),
    u_to_w_equals_u_to_w1 ).

cnf(c_0_19,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_16 ).

cnf(c_0_20,hypothesis,
    equidistant(v,w1,v,w),
    inference(spm,[status(thm)],[c_0_14,c_0_17]) ).

cnf(c_0_21,hypothesis,
    equidistant(w1,u,w,u),
    inference(spm,[status(thm)],[c_0_12,c_0_18]) ).

cnf(c_0_22,hypothesis,
    ( ~ equidistant(X1,v,X4,v)
    | ~ equidistant(X1,w1,X4,w)
    | ~ equidistant(v,X2,v,X3)
    | ~ between(X1,v,X2)
    | ~ between(X4,v,X3)
    | equidistant(X2,w1,X3,w)
    | X1 = v ),
    inference(spm,[status(thm)],[c_0_19,c_0_20]) ).

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

cnf(c_0_24,hypothesis,
    equidistant(u,w,w1,u),
    inference(spm,[status(thm)],[c_0_14,c_0_21]) ).

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

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

cnf(c_0_27,hypothesis,
    ( ~ equidistant(X1,v,X3,v)
    | ~ equidistant(X1,w1,X3,w)
    | ~ between(X1,v,X2)
    | ~ between(X3,v,X2)
    | equidistant(X2,w1,X2,w)
    | X1 = v ),
    inference(spm,[status(thm)],[c_0_22,c_0_23]) ).

cnf(c_0_28,hypothesis,
    equidistant(u,w1,u,w),
    inference(spm,[status(thm)],[c_0_14,c_0_24]) ).

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

cnf(c_0_30,negated_conjecture,
    w != w1,
    inference(fof_simplification,[status(thm)],[prove_w_is_w1]) ).

cnf(c_0_31,plain,
    ( ~ equidistant(X1,X2,X3,X3)
    | X1 = X2 ),
    c_0_26 ).

cnf(c_0_32,hypothesis,
    ( ~ between(u,v,X1)
    | equidistant(X1,w1,X1,w) ),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_23])]),c_0_29]) ).

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

cnf(c_0_34,negated_conjecture,
    w != w1,
    c_0_30 ).

cnf(c_0_35,hypothesis,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33])]),c_0_34]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : GEO030-3 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.36  % Computer : n005.cluster.edu
% 0.11/0.36  % Model    : x86_64 x86_64
% 0.11/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36  % Memory   : 8046.5625MB
% 0.11/0.36  % OS       : Linux 6.8.0-71-generic
% 0.11/0.36  % CPULimit : 300
% 0.11/0.36  % WCLimit  : 300
% 0.11/0.36  % DateTime : Sun Sep 20 08:23:48 UTC 2026
% 0.11/0.36  % CPUTime  : 
% 0.11/0.36  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.41  Running first-order theorem proving
% 0.11/0.41  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
% 10.65/2.05  % Version: 3.5.1
% 10.65/2.05  % Preprocessing class: FSLSSMSSSSSNFFN.
% 10.65/2.05  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 10.65/2.05  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 10.65/2.05  % Starting new_bool_3 with 300s (1) cores
% 10.65/2.05  % Starting new_bool_1 with 300s (1) cores
% 10.65/2.05  % Starting sh5l with 300s (1) cores
% 10.65/2.05  % new_bool_3 with pid 798556 completed with status 0
% 10.65/2.05  % Result found by new_bool_3
% 10.65/2.05  % Preprocessing class: FSLSSMSSSSSNFFN.
% 10.65/2.05  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 10.65/2.05  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 10.65/2.05  % Starting new_bool_3 with 300s (1) cores
% 10.65/2.05  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 10.65/2.05  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 10.65/2.05  % Search class: FGUSM-FFMS00-SFFFFFNN
% 10.65/2.05  % partial match(2): FGUSM-FFMS33-SFFFFFNN
% 10.65/2.05  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 10.65/2.05  % Starting SubtermCWHack with 31s (1) cores
% 10.65/2.05  % SubtermCWHack with pid 798560 completed with status 0
% 10.65/2.05  % Result found by SubtermCWHack
% 10.65/2.05  % Preprocessing class: FSLSSMSSSSSNFFN.
% 10.65/2.05  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 10.65/2.05  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 10.65/2.05  % Starting new_bool_3 with 300s (1) cores
% 10.65/2.05  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 10.65/2.05  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 10.65/2.05  % Search class: FGUSM-FFMS00-SFFFFFNN
% 10.65/2.05  % partial match(2): FGUSM-FFMS33-SFFFFFNN
% 10.65/2.05  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 10.65/2.05  % Starting SubtermCWHack with 31s (1) cores
% 10.65/2.05  % Preprocessing time       : 0.001 s
% 10.65/2.05  
% 10.65/2.05  % Proof found!
% 10.65/2.05  % SZS status Unsatisfiable
% 10.65/2.05  % SZS output start CNFRefutation
% See solution above
% 10.65/2.05  % Parsed axioms                        : 69
% 10.65/2.05  % Removed by relevancy pruning/SinE    : 32
% 10.65/2.05  % Initial clauses                      : 37
% 10.65/2.05  % Removed in clause preprocessing      : 1
% 10.65/2.05  % Initial clauses in saturation        : 36
% 10.65/2.05  % Processed clauses                    : 21220
% 10.65/2.05  % ...of these trivial                  : 4
% 10.65/2.05  % ...subsumed                          : 18418
% 10.65/2.05  % ...remaining for further processing  : 2798
% 10.65/2.05  % Other redundant clauses eliminated   : 1
% 10.65/2.05  % Clauses deleted for lack of memory   : 0
% 10.65/2.05  % Backward-subsumed                    : 44
% 10.65/2.05  % Backward-rewritten                   : 0
% 10.65/2.05  % Generated clauses                    : 92821
% 10.65/2.05  % ...of the previous two non-redundant : 65938
% 10.65/2.05  % ...aggressively subsumed             : 0
% 10.65/2.05  % Contextual simplify-reflections      : 10
% 10.65/2.05  % Paramodulations                      : 92820
% 10.65/2.05  % Factorizations                       : 0
% 10.65/2.05  % NegExts                              : 0
% 10.65/2.05  % Equation resolutions                 : 1
% 10.65/2.05  % Disequality decompositions           : 0
% 10.65/2.05  % Total rewrite steps                  : 56589
% 10.65/2.05  % ...of those cached                   : 56457
% 10.65/2.05  % Propositional unsat checks           : 0
% 10.65/2.05  %    Propositional check models        : 0
% 10.65/2.05  %    Propositional check unsatisfiable : 0
% 10.65/2.05  %    Propositional clauses             : 0
% 10.65/2.05  %    Propositional clauses after purity: 0
% 10.65/2.05  %    Propositional unsat core size     : 0
% 10.65/2.05  %    Propositional preprocessing time  : 0.000
% 10.65/2.05  %    Propositional encoding time       : 0.000
% 10.65/2.05  %    Propositional solver time         : 0.000
% 10.65/2.05  %    Success case prop preproc time    : 0.000
% 10.65/2.05  %    Success case prop encoding time   : 0.000
% 10.65/2.05  %    Success case prop solver time     : 0.000
% 10.65/2.05  % Current number of processed clauses  : 2753
% 10.65/2.05  %    Positive orientable unit clauses  : 23
% 10.65/2.05  %    Positive unorientable unit clauses: 0
% 10.65/2.05  %    Negative unit clauses             : 13
% 10.65/2.05  %    Non-unit-clauses                  : 2717
% 10.65/2.05  % Current number of unprocessed clauses: 44336
% 10.65/2.06  % ...number of literals in the above   : 268396
% 10.65/2.06  % Current number of archived formulas  : 0
% 10.65/2.06  % Current number of archived clauses   : 44
% 10.65/2.06  % Clause-clause subsumption calls (NU) : 3055325
% 10.65/2.06  % Rec. Clause-clause subsumption calls : 1367181
% 10.65/2.06  % Non-unit clause-clause subsumptions  : 17391
% 10.65/2.06  % Unit Clause-clause subsumption calls : 1506
% 10.65/2.06  % Rewrite failures with RHS unbound    : 0
% 10.65/2.06  % BW rewrite match attempts            : 20
% 10.65/2.06  % BW rewrite match successes           : 0
% 10.65/2.06  % Condensation attempts                : 0
% 10.65/2.06  % Condensation successes               : 0
% 10.65/2.06  % Termbank termtop insertions          : 1707264
% 10.65/2.06  % Search garbage collected termcells   : 219
% 10.65/2.06  
% 10.65/2.06  % -------------------------------------------------
% 10.65/2.06  % User time                : 1.432 s
% 10.65/2.06  % System time              : 0.035 s
% 10.65/2.06  % Total time               : 1.467 s
% 10.65/2.06  % Maximum resident set size: 3684 pages
% 10.65/2.06  
% 10.65/2.06  % -------------------------------------------------
% 10.65/2.06  % User time                : 1.436 s
% 10.65/2.06  % System time              : 0.038 s
% 10.65/2.06  % Total time               : 1.474 s
% 10.65/2.06  % Maximum resident set size: 4864 pages
% 10.65/2.06  % E exiting
%------------------------------------------------------------------------------