↑ Up

E---3.5.1.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : GEO051-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 : n013.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.20s 0.55s
% Output   : CNFRefutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    7
% Syntax   : Number of clauses     :   25 (  15 unt;   6 nHn;  25 RR)
%            Number of literals    :   49 (   6 equ;  24 neg)
%            Maximal clause size   :    5 (   1 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-3 aty)
%            Number of functors    :    4 (   4 usr;   4 con; 0-0 aty)
%            Number of variables   :   27 (   0 sgn)

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

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

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

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

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

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

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(c_0_7,plain,
    ( ~ between(X1,X2,X4)
    | ~ between(X1,X2,X3)
    | between(X1,X4,X3)
    | between(X1,X3,X4)
    | X1 = X2 ),
    inference(fof_simplification,[status(thm)],[b12]) ).

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

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

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

cnf(c_0_11,hypothesis,
    u != v,
    c_0_8 ).

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

cnf(c_0_13,hypothesis,
    ( ~ between(u,v,X1)
    | between(u,w,X1)
    | between(u,X1,w) ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11]) ).

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

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

cnf(c_0_16,hypothesis,
    ( between(u,x,w)
    | between(u,w,x) ),
    inference(spm,[status(thm)],[c_0_13,c_0_14]) ).

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

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

cnf(c_0_19,negated_conjecture,
    ~ between(v,x,w),
    c_0_17 ).

cnf(c_0_20,hypothesis,
    between(u,w,x),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_14]),c_0_19]) ).

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(u,X1,w)
    | between(X1,w,x) ),
    inference(spm,[status(thm)],[c_0_15,c_0_20]) ).

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : GEO051-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.10/0.39  % Computer : n013.cluster.edu
% 0.10/0.39  % Model    : x86_64 x86_64
% 0.10/0.39  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.39  % Memory   : 8046.5625MB
% 0.10/0.39  % OS       : Linux 6.8.0-71-generic
% 0.10/0.39  % CPULimit : 300
% 0.10/0.39  % WCLimit  : 300
% 0.10/0.39  % DateTime : Sun Sep 20 08:44:37 UTC 2026
% 0.10/0.40  % CPUTime  : 
% 0.10/0.40  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.47  Running first-order theorem proving
% 0.10/0.47  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.20/0.55  % Version: 3.5.1
% 0.20/0.55  % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.55  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.55  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.55  % Starting new_bool_3 with 300s (1) cores
% 0.20/0.55  % Starting new_bool_1 with 300s (1) cores
% 0.20/0.55  % Starting sh5l with 300s (1) cores
% 0.20/0.55  % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 2518540 completed with status 0
% 0.20/0.55  % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.20/0.55  % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.55  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.55  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.55  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.20/0.55  % No SInE strategy applied
% 0.20/0.55  % Search class: FGUSM-FFMF33-SFFFFFNN
% 0.20/0.55  % Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.55  % Starting SubtermCWHack with 151s (1) cores
% 0.20/0.55  % Starting G-E--_215_C46_F1_AE_CS_SP_PS_S2S with 901s (1) cores
% 0.20/0.55  % Starting G-E--_207_C18_F1_AE_CS_SP_PI_S0a with 151s (1) cores
% 0.20/0.55  % Starting new_bool_3 with 151s (1) cores
% 0.20/0.55  % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S070I with 146s (1) cores
% 0.20/0.55  % new_bool_3 with pid 2518550 completed with status 0
% 0.20/0.55  % Result found by new_bool_3
% 0.20/0.55  % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.55  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.55  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.55  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.20/0.55  % No SInE strategy applied
% 0.20/0.55  % Search class: FGUSM-FFMF33-SFFFFFNN
% 0.20/0.55  % Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.55  % Starting SubtermCWHack with 151s (1) cores
% 0.20/0.55  % Starting G-E--_215_C46_F1_AE_CS_SP_PS_S2S with 901s (1) cores
% 0.20/0.55  % Starting G-E--_207_C18_F1_AE_CS_SP_PI_S0a with 151s (1) cores
% 0.20/0.55  % Starting new_bool_3 with 151s (1) cores
% 0.20/0.55  % Preprocessing time       : 0.002 s
% 0.20/0.55  % Presaturation interreduction done
% 0.20/0.55  
% 0.20/0.55  % Proof found!
% 0.20/0.55  % SZS status Unsatisfiable
% 0.20/0.55  % SZS output start CNFRefutation
% See solution above
% 0.20/0.55  % Parsed axioms                        : 82
% 0.20/0.55  % Removed by relevancy pruning/SinE    : 0
% 0.20/0.55  % Initial clauses                      : 82
% 0.20/0.55  % Removed in clause preprocessing      : 3
% 0.20/0.55  % Initial clauses in saturation        : 79
% 0.20/0.55  % Processed clauses                    : 279
% 0.20/0.55  % ...of these trivial                  : 5
% 0.20/0.55  % ...subsumed                          : 51
% 0.20/0.55  % ...remaining for further processing  : 223
% 0.20/0.55  % Other redundant clauses eliminated   : 4
% 0.20/0.55  % Clauses deleted for lack of memory   : 0
% 0.20/0.55  % Backward-subsumed                    : 1
% 0.20/0.55  % Backward-rewritten                   : 7
% 0.20/0.55  % Generated clauses                    : 620
% 0.20/0.55  % ...of the previous two non-redundant : 434
% 0.20/0.55  % ...aggressively subsumed             : 0
% 0.20/0.55  % Contextual simplify-reflections      : 0
% 0.20/0.55  % Paramodulations                      : 616
% 0.20/0.55  % Factorizations                       : 0
% 0.20/0.55  % NegExts                              : 0
% 0.20/0.55  % Equation resolutions                 : 4
% 0.20/0.55  % Disequality decompositions           : 0
% 0.20/0.55  % Total rewrite steps                  : 190
% 0.20/0.55  % ...of those cached                   : 117
% 0.20/0.55  % Propositional unsat checks           : 0
% 0.20/0.55  %    Propositional check models        : 0
% 0.20/0.55  %    Propositional check unsatisfiable : 0
% 0.20/0.55  %    Propositional clauses             : 0
% 0.20/0.55  %    Propositional clauses after purity: 0
% 0.20/0.55  %    Propositional unsat core size     : 0
% 0.20/0.55  %    Propositional preprocessing time  : 0.000
% 0.20/0.55  %    Propositional encoding time       : 0.000
% 0.20/0.55  %    Propositional solver time         : 0.000
% 0.20/0.55  %    Success case prop preproc time    : 0.000
% 0.20/0.55  %    Success case prop encoding time   : 0.000
% 0.20/0.55  %    Success case prop solver time     : 0.000
% 0.20/0.55  % Current number of processed clauses  : 142
% 0.20/0.55  %    Positive orientable unit clauses  : 32
% 0.20/0.55  %    Positive unorientable unit clauses: 0
% 0.20/0.55  %    Negative unit clauses             : 14
% 0.20/0.55  %    Non-unit-clauses                  : 96
% 0.20/0.55  % Current number of unprocessed clauses: 303
% 0.20/0.55  % ...number of literals in the above   : 735
% 0.20/0.55  % Current number of archived formulas  : 0
% 0.20/0.55  % Current number of archived clauses   : 80
% 0.20/0.55  % Clause-clause subsumption calls (NU) : 3748
% 0.20/0.55  % Rec. Clause-clause subsumption calls : 3170
% 0.20/0.55  % Non-unit clause-clause subsumptions  : 50
% 0.20/0.55  % Unit Clause-clause subsumption calls : 79
% 0.20/0.55  % Rewrite failures with RHS unbound    : 0
% 0.20/0.55  % BW rewrite match attempts            : 164
% 0.20/0.55  % BW rewrite match successes           : 2
% 0.20/0.55  % Condensation attempts                : 0
% 0.20/0.55  % Condensation successes               : 0
% 0.20/0.55  % Termbank termtop insertions          : 9998
% 0.20/0.55  % Search garbage collected termcells   : 196
% 0.20/0.55  
% 0.20/0.55  % -------------------------------------------------
% 0.20/0.55  % User time                : 0.022 s
% 0.20/0.55  % System time              : 0.005 s
% 0.20/0.55  % Total time               : 0.028 s
% 0.20/0.55  % Maximum resident set size: 3696 pages
% 0.20/0.55  
% 0.20/0.55  % -------------------------------------------------
% 0.20/0.55  % User time                : 0.062 s
% 0.20/0.55  % System time              : 0.021 s
% 0.20/0.55  % Total time               : 0.083 s
% 0.20/0.55  % Maximum resident set size: 4864 pages
% 0.20/0.55  % E exiting
%------------------------------------------------------------------------------