↑ Up

E---3.5.1.UNS-CRf.s

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

% Result   : Unsatisfiable 2.25s 0.75s
% Output   : CNFRefutation 2.25s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   11
% Syntax   : Number of clauses     :   36 (  22 unt;   0 nHn;  36 RR)
%            Number of literals    :   80 (   0 equ;  47 neg)
%            Maximal clause size   :    7 (   2 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-4 aty)
%            Number of functors    :    8 (   8 usr;   8 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(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/sandbox2/benchmark/theBenchmark.p',d8) ).

cnf(u_to_v_equals_u1_to_v1,hypothesis,
    equidistant(u,v,u1,v1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',u_to_v_equals_u1_to_v1) ).

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

cnf(v_to_w_equals_v1_to_w1,hypothesis,
    equidistant(v,w,v1,w1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',v_to_w_equals_v1_to_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(v1_between_u1_and_w1,hypothesis,
    between(u1,v1,w1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',v1_between_u1_and_w1) ).

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

cnf(w_to_x_equals_w1_to_x1,hypothesis,
    equidistant(w,x,w1,x1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',w_to_x_equals_w1_to_x1) ).

cnf(prove_v_to_x_equals_v1_to_x1,negated_conjecture,
    ~ equidistant(v,x,v1,x1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_v_to_x_equals_v1_to_x1) ).

cnf(u_to_x_equals_u1_to_x1,hypothesis,
    equidistant(u,x,u1,x1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',u_to_x_equals_u1_to_x1) ).

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

cnf(c_0_12,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_13,plain,
    ( ~ equidistant(X1,X2,X3,X4)
    | equidistant(X4,X3,X2,X1) ),
    c_0_11 ).

cnf(c_0_14,hypothesis,
    equidistant(u,v,u1,v1),
    u_to_v_equals_u1_to_v1 ).

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

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_12 ).

cnf(c_0_17,hypothesis,
    equidistant(v1,u1,v,u),
    inference(spm,[status(thm)],[c_0_13,c_0_14]) ).

cnf(c_0_18,hypothesis,
    equidistant(v,w,v1,w1),
    v_to_w_equals_v1_to_w1 ).

cnf(c_0_19,plain,
    ( ~ between(X1,X2,X3)
    | between(X3,X2,X1) ),
    c_0_15 ).

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

cnf(c_0_21,hypothesis,
    between(u1,v1,w1),
    v1_between_u1_and_w1 ).

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

cnf(c_0_23,hypothesis,
    ( ~ equidistant(X1,v1,X2,v)
    | ~ between(X1,v1,u1)
    | ~ between(X2,v,u)
    | equidistant(X1,u1,X2,u) ),
    inference(spm,[status(thm)],[c_0_16,c_0_17]) ).

cnf(c_0_24,hypothesis,
    equidistant(w1,v1,w,v),
    inference(spm,[status(thm)],[c_0_13,c_0_18]) ).

cnf(c_0_25,hypothesis,
    between(w,v,u),
    inference(spm,[status(thm)],[c_0_19,c_0_20]) ).

cnf(c_0_26,hypothesis,
    between(w1,v1,u1),
    inference(spm,[status(thm)],[c_0_19,c_0_21]) ).

cnf(c_0_27,plain,
    ( ~ between(X3,X4,X6)
    | ~ between(X1,X2,X5)
    | ~ equidistant(X5,X7,X6,X8)
    | ~ equidistant(X1,X7,X3,X8)
    | ~ equidistant(X1,X5,X3,X6)
    | ~ equidistant(X1,X2,X3,X4)
    | equidistant(X2,X7,X4,X8) ),
    c_0_22 ).

cnf(c_0_28,hypothesis,
    equidistant(w,x,w1,x1),
    w_to_x_equals_w1_to_x1 ).

cnf(c_0_29,hypothesis,
    equidistant(w1,u1,w,u),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]),c_0_26])]) ).

cnf(c_0_30,negated_conjecture,
    ~ equidistant(v,x,v1,x1),
    inference(fof_simplification,[status(thm)],[prove_v_to_x_equals_v1_to_x1]) ).

cnf(c_0_31,hypothesis,
    ( ~ equidistant(X4,X1,X3,X2)
    | ~ equidistant(X4,w,X3,w1)
    | ~ equidistant(X4,x,X3,x1)
    | ~ between(X4,X1,w)
    | ~ between(X3,X2,w1)
    | equidistant(X1,x,X2,x1) ),
    inference(spm,[status(thm)],[c_0_27,c_0_28]) ).

cnf(c_0_32,hypothesis,
    equidistant(u,x,u1,x1),
    u_to_x_equals_u1_to_x1 ).

cnf(c_0_33,hypothesis,
    equidistant(u,w,u1,w1),
    inference(spm,[status(thm)],[c_0_13,c_0_29]) ).

cnf(c_0_34,negated_conjecture,
    ~ equidistant(v,x,v1,x1),
    c_0_30 ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : GEO033-3 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.04  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.36  % Computer : n016.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:35:51 UTC 2026
% 0.08/0.36  % CPUTime  : 
% 0.08/0.36  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.40  Running first-order theorem proving
% 0.08/0.40  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
% 2.25/0.75  % Version: 3.5.1
% 2.25/0.75  % Preprocessing class: FSLSSMSMSSSNFFN.
% 2.25/0.75  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.25/0.75  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 2.25/0.75  % Starting new_bool_3 with 300s (1) cores
% 2.25/0.75  % Starting new_bool_1 with 300s (1) cores
% 2.25/0.75  % Starting sh5l with 300s (1) cores
% 2.25/0.75  % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 4104972 completed with status 0
% 2.25/0.75  % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 2.25/0.75  % Preprocessing class: FSLSSMSMSSSNFFN.
% 2.25/0.75  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.25/0.75  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 2.25/0.75  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 2.25/0.75  % No SInE strategy applied
% 2.25/0.75  % Search class: FGUSM-FFMM33-SFFFFFNN
% 2.25/0.75  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 2.25/0.75  % Starting SubtermCWHack with 136s (1) cores
% 2.25/0.75  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 2.25/0.75  % Starting new_bool_3 with 309s (1) cores
% 2.25/0.75  % Starting new_bool_1 with 307s (1) cores
% 2.25/0.75  % Starting sh5l with 304s (1) cores
% 2.25/0.75  % new_bool_3 with pid 4104980 completed with status 0
% 2.25/0.75  % Result found by new_bool_3
% 2.25/0.75  % Preprocessing class: FSLSSMSMSSSNFFN.
% 2.25/0.75  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.25/0.75  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 2.25/0.75  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 2.25/0.75  % No SInE strategy applied
% 2.25/0.75  % Search class: FGUSM-FFMM33-SFFFFFNN
% 2.25/0.75  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 2.25/0.75  % Starting SubtermCWHack with 136s (1) cores
% 2.25/0.75  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 2.25/0.75  % Starting new_bool_3 with 309s (1) cores
% 2.25/0.75  % Preprocessing time       : 0.002 s
% 2.25/0.75  % Presaturation interreduction done
% 2.25/0.75  
% 2.25/0.75  % Proof found!
% 2.25/0.75  % SZS status Unsatisfiable
% 2.25/0.75  % SZS output start CNFRefutation
% See solution above
% 2.25/0.75  % Parsed axioms                        : 74
% 2.25/0.75  % Removed by relevancy pruning/SinE    : 0
% 2.25/0.75  % Initial clauses                      : 74
% 2.25/0.75  % Removed in clause preprocessing      : 2
% 2.25/0.75  % Initial clauses in saturation        : 72
% 2.25/0.75  % Processed clauses                    : 2085
% 2.25/0.75  % ...of these trivial                  : 204
% 2.25/0.75  % ...subsumed                          : 817
% 2.25/0.75  % ...remaining for further processing  : 1064
% 2.25/0.75  % Other redundant clauses eliminated   : 5
% 2.25/0.75  % Clauses deleted for lack of memory   : 0
% 2.25/0.75  % Backward-subsumed                    : 20
% 2.25/0.75  % Backward-rewritten                   : 21
% 2.25/0.75  % Generated clauses                    : 16244
% 2.25/0.75  % ...of the previous two non-redundant : 13055
% 2.25/0.75  % ...aggressively subsumed             : 0
% 2.25/0.75  % Contextual simplify-reflections      : 0
% 2.25/0.75  % Paramodulations                      : 16239
% 2.25/0.75  % Factorizations                       : 0
% 2.25/0.75  % NegExts                              : 0
% 2.25/0.75  % Equation resolutions                 : 5
% 2.25/0.75  % Disequality decompositions           : 0
% 2.25/0.75  % Total rewrite steps                  : 4164
% 2.25/0.75  % ...of those cached                   : 3394
% 2.25/0.75  % Propositional unsat checks           : 0
% 2.25/0.75  %    Propositional check models        : 0
% 2.25/0.75  %    Propositional check unsatisfiable : 0
% 2.25/0.75  %    Propositional clauses             : 0
% 2.25/0.75  %    Propositional clauses after purity: 0
% 2.25/0.75  %    Propositional unsat core size     : 0
% 2.25/0.75  %    Propositional preprocessing time  : 0.000
% 2.25/0.75  %    Propositional encoding time       : 0.000
% 2.25/0.75  %    Propositional solver time         : 0.000
% 2.25/0.75  %    Success case prop preproc time    : 0.000
% 2.25/0.75  %    Success case prop encoding time   : 0.000
% 2.25/0.75  %    Success case prop solver time     : 0.000
% 2.25/0.75  % Current number of processed clauses  : 957
% 2.25/0.75  %    Positive orientable unit clauses  : 167
% 2.25/0.75  %    Positive unorientable unit clauses: 0
% 2.25/0.75  %    Negative unit clauses             : 20
% 2.25/0.75  %    Non-unit-clauses                  : 770
% 2.25/0.75  % Current number of unprocessed clauses: 10962
% 2.25/0.75  % ...number of literals in the above   : 29474
% 2.25/0.75  % Current number of archived formulas  : 0
% 2.25/0.75  % Current number of archived clauses   : 105
% 2.25/0.75  % Clause-clause subsumption calls (NU) : 143483
% 2.25/0.75  % Rec. Clause-clause subsumption calls : 111271
% 2.25/0.75  % Non-unit clause-clause subsumptions  : 794
% 2.25/0.75  % Unit Clause-clause subsumption calls : 1861
% 2.25/0.75  % Rewrite failures with RHS unbound    : 0
% 2.25/0.75  % BW rewrite match attempts            : 2393
% 2.25/0.75  % BW rewrite match successes           : 20
% 2.25/0.75  % Condensation attempts                : 0
% 2.25/0.75  % Condensation successes               : 0
% 2.25/0.75  % Termbank termtop insertions          : 264525
% 2.25/0.75  % Search garbage collected termcells   : 167
% 2.25/0.75  
% 2.25/0.75  % -------------------------------------------------
% 2.25/0.75  % User time                : 0.304 s
% 2.25/0.75  % System time              : 0.023 s
% 2.25/0.75  % Total time               : 0.327 s
% 2.25/0.75  % Maximum resident set size: 3692 pages
% 2.25/0.75  
% 2.25/0.75  % -------------------------------------------------
% 2.25/0.75  % User time                : 1.414 s
% 2.25/0.75  % System time              : 0.069 s
% 2.25/0.75  % Total time               : 1.483 s
% 2.25/0.75  % Maximum resident set size: 4864 pages
% 2.25/0.75  % E exiting
%------------------------------------------------------------------------------