↑ Up

E---3.5.1.UNS-CRf.s

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

% Computer : n004.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 02:01:41 PM UTC 2026

% Result   : Unsatisfiable 7.59s 1.55s
% Output   : CNFRefutation 7.59s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    8
% Syntax   : Number of clauses     :   30 (  12 unt;   0 nHn;  30 RR)
%            Number of literals    :   48 (   0 equ;  21 neg)
%            Maximal clause size   :    2 (   1 avg)
%            Maximal term depth    :    6 (   2 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-12 aty)
%            Number of functors    :   14 (  14 usr;   1 con; 0-2 aty)
%            Number of variables   :  252 (  33 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(s3_left,axiom,
    ( ~ state(X1,X2,X3,X4,X5,X6,X7,X8,s3(X9,s(X10)),X11,e1(X9,X10),X12)
    | state(X1,X2,X3,X4,X5,X6,X7,X8,s3(X9,X10),X11,e1(X9,s(X10)),X12) ),
    file('/export/starexec/sandbox/benchmark/Axioms/PUZ004-0.ax',s3_left) ).

cnf(swap_blanks,axiom,
    ( ~ state(X1,X2,X3,X4,X5,X6,X7,X8,X9,X10,e1(X11,X12),e2(X13,X14))
    | state(X1,X2,X3,X4,X5,X6,X7,X8,X9,X10,e1(X13,X14),e2(X11,X12)) ),
    file('/export/starexec/sandbox/benchmark/Axioms/PUZ004-0.ax',swap_blanks) ).

cnf(initial_state,hypothesis,
    state(bb(o,s(o)),v1(o,o),v2(o,s(s(s(o)))),v3(s(s(o)),o),v4(s(s(o)),s(s(s(o)))),h(s(s(o)),s(o)),s1(s(s(s(o))),s(o)),s2(s(s(s(o))),s(s(o))),s3(s(s(s(s(o)))),s(o)),s4(s(s(s(s(o)))),s(s(o))),e1(s(s(s(s(o)))),o),e2(s(s(s(s(o)))),s(s(s(o))))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',initial_state) ).

cnf(s4_right,axiom,
    ( ~ state(X1,X2,X3,X4,X5,X6,X7,X8,X9,s4(X10,X11),e1(X10,s(X11)),X12)
    | state(X1,X2,X3,X4,X5,X6,X7,X8,X9,s4(X10,s(X11)),e1(X10,X11),X12) ),
    file('/export/starexec/sandbox/benchmark/Axioms/PUZ004-0.ax',s4_right) ).

cnf(s2_down,axiom,
    ( ~ state(X1,X2,X3,X4,X5,X6,X7,s2(X8,X9),X10,X11,e1(s(X8),X9),X12)
    | state(X1,X2,X3,X4,X5,X6,X7,s2(s(X8),X9),X10,X11,e1(X8,X9),X12) ),
    file('/export/starexec/sandbox/benchmark/Axioms/PUZ004-0.ax',s2_down) ).

cnf(s1_down,axiom,
    ( ~ state(X1,X2,X3,X4,X5,X6,s1(X7,X8),X9,X10,X11,e1(s(X7),X8),X12)
    | state(X1,X2,X3,X4,X5,X6,s1(s(X7),X8),X9,X10,X11,e1(X7,X8),X12) ),
    file('/export/starexec/sandbox/benchmark/Axioms/PUZ004-0.ax',s1_down) ).

cnf(h_down,axiom,
    ( ~ state(X1,X2,X3,X4,X5,h(X6,X7),X8,X9,X10,X11,e1(s(X6),X7),e2(s(X6),s(X7)))
    | state(X1,X2,X3,X4,X5,h(s(X6),X7),X8,X9,X10,X11,e1(X6,X7),e2(X6,s(X7))) ),
    file('/export/starexec/sandbox/benchmark/Axioms/PUZ004-0.ax',h_down) ).

cnf(goal_state,negated_conjecture,
    ~ state(X1,X2,X3,X4,X5,h(s(s(s(o))),s(o)),X6,X7,X8,X9,X10,X11),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',goal_state) ).

cnf(c_0_8,plain,
    ( ~ state(X1,X2,X3,X4,X5,X6,X7,X8,s3(X9,s(X10)),X11,e1(X9,X10),X12)
    | state(X1,X2,X3,X4,X5,X6,X7,X8,s3(X9,X10),X11,e1(X9,s(X10)),X12) ),
    inference(fof_simplification,[status(thm)],[s3_left]) ).

cnf(c_0_9,plain,
    ( ~ state(X1,X2,X3,X4,X5,X6,X7,X8,X9,X10,e1(X11,X12),e2(X13,X14))
    | state(X1,X2,X3,X4,X5,X6,X7,X8,X9,X10,e1(X13,X14),e2(X11,X12)) ),
    inference(fof_simplification,[status(thm)],[swap_blanks]) ).

cnf(c_0_10,plain,
    ( ~ state(X1,X2,X3,X4,X5,X6,X7,X8,s3(X9,s(X10)),X11,e1(X9,X10),X12)
    | state(X1,X2,X3,X4,X5,X6,X7,X8,s3(X9,X10),X11,e1(X9,s(X10)),X12) ),
    c_0_8 ).

cnf(c_0_11,hypothesis,
    state(bb(o,s(o)),v1(o,o),v2(o,s(s(s(o)))),v3(s(s(o)),o),v4(s(s(o)),s(s(s(o)))),h(s(s(o)),s(o)),s1(s(s(s(o))),s(o)),s2(s(s(s(o))),s(s(o))),s3(s(s(s(s(o)))),s(o)),s4(s(s(s(s(o)))),s(s(o))),e1(s(s(s(s(o)))),o),e2(s(s(s(s(o)))),s(s(s(o))))),
    initial_state ).

cnf(c_0_12,plain,
    ( ~ state(X1,X2,X3,X4,X5,X6,X7,X8,X9,s4(X10,X11),e1(X10,s(X11)),X12)
    | state(X1,X2,X3,X4,X5,X6,X7,X8,X9,s4(X10,s(X11)),e1(X10,X11),X12) ),
    inference(fof_simplification,[status(thm)],[s4_right]) ).

cnf(c_0_13,plain,
    ( ~ state(X1,X2,X3,X4,X5,X6,X7,X8,X9,X10,e1(X11,X12),e2(X13,X14))
    | state(X1,X2,X3,X4,X5,X6,X7,X8,X9,X10,e1(X13,X14),e2(X11,X12)) ),
    c_0_9 ).

cnf(c_0_14,hypothesis,
    state(bb(o,s(o)),v1(o,o),v2(o,s(s(s(o)))),v3(s(s(o)),o),v4(s(s(o)),s(s(s(o)))),h(s(s(o)),s(o)),s1(s(s(s(o))),s(o)),s2(s(s(s(o))),s(s(o))),s3(s(s(s(s(o)))),o),s4(s(s(s(s(o)))),s(s(o))),e1(s(s(s(s(o)))),s(o)),e2(s(s(s(s(o)))),s(s(s(o))))),
    inference(spm,[status(thm)],[c_0_10,c_0_11]) ).

cnf(c_0_15,plain,
    ( ~ state(X1,X2,X3,X4,X5,X6,X7,s2(X8,X9),X10,X11,e1(s(X8),X9),X12)
    | state(X1,X2,X3,X4,X5,X6,X7,s2(s(X8),X9),X10,X11,e1(X8,X9),X12) ),
    inference(fof_simplification,[status(thm)],[s2_down]) ).

cnf(c_0_16,plain,
    ( ~ state(X1,X2,X3,X4,X5,X6,X7,X8,X9,s4(X10,X11),e1(X10,s(X11)),X12)
    | state(X1,X2,X3,X4,X5,X6,X7,X8,X9,s4(X10,s(X11)),e1(X10,X11),X12) ),
    c_0_12 ).

cnf(c_0_17,hypothesis,
    state(bb(o,s(o)),v1(o,o),v2(o,s(s(s(o)))),v3(s(s(o)),o),v4(s(s(o)),s(s(s(o)))),h(s(s(o)),s(o)),s1(s(s(s(o))),s(o)),s2(s(s(s(o))),s(s(o))),s3(s(s(s(s(o)))),o),s4(s(s(s(s(o)))),s(s(o))),e1(s(s(s(s(o)))),s(s(s(o)))),e2(s(s(s(s(o)))),s(o))),
    inference(spm,[status(thm)],[c_0_13,c_0_14]) ).

cnf(c_0_18,plain,
    ( ~ state(X1,X2,X3,X4,X5,X6,X7,s2(X8,X9),X10,X11,e1(s(X8),X9),X12)
    | state(X1,X2,X3,X4,X5,X6,X7,s2(s(X8),X9),X10,X11,e1(X8,X9),X12) ),
    c_0_15 ).

cnf(c_0_19,hypothesis,
    state(bb(o,s(o)),v1(o,o),v2(o,s(s(s(o)))),v3(s(s(o)),o),v4(s(s(o)),s(s(s(o)))),h(s(s(o)),s(o)),s1(s(s(s(o))),s(o)),s2(s(s(s(o))),s(s(o))),s3(s(s(s(s(o)))),o),s4(s(s(s(s(o)))),s(s(s(o)))),e1(s(s(s(s(o)))),s(s(o))),e2(s(s(s(s(o)))),s(o))),
    inference(spm,[status(thm)],[c_0_16,c_0_17]) ).

cnf(c_0_20,plain,
    ( ~ state(X1,X2,X3,X4,X5,X6,s1(X7,X8),X9,X10,X11,e1(s(X7),X8),X12)
    | state(X1,X2,X3,X4,X5,X6,s1(s(X7),X8),X9,X10,X11,e1(X7,X8),X12) ),
    inference(fof_simplification,[status(thm)],[s1_down]) ).

cnf(c_0_21,hypothesis,
    state(bb(o,s(o)),v1(o,o),v2(o,s(s(s(o)))),v3(s(s(o)),o),v4(s(s(o)),s(s(s(o)))),h(s(s(o)),s(o)),s1(s(s(s(o))),s(o)),s2(s(s(s(s(o)))),s(s(o))),s3(s(s(s(s(o)))),o),s4(s(s(s(s(o)))),s(s(s(o)))),e1(s(s(s(o))),s(s(o))),e2(s(s(s(s(o)))),s(o))),
    inference(spm,[status(thm)],[c_0_18,c_0_19]) ).

cnf(c_0_22,plain,
    ( ~ state(X1,X2,X3,X4,X5,h(X6,X7),X8,X9,X10,X11,e1(s(X6),X7),e2(s(X6),s(X7)))
    | state(X1,X2,X3,X4,X5,h(s(X6),X7),X8,X9,X10,X11,e1(X6,X7),e2(X6,s(X7))) ),
    inference(fof_simplification,[status(thm)],[h_down]) ).

cnf(c_0_23,plain,
    ( ~ state(X1,X2,X3,X4,X5,X6,s1(X7,X8),X9,X10,X11,e1(s(X7),X8),X12)
    | state(X1,X2,X3,X4,X5,X6,s1(s(X7),X8),X9,X10,X11,e1(X7,X8),X12) ),
    c_0_20 ).

cnf(c_0_24,hypothesis,
    state(bb(o,s(o)),v1(o,o),v2(o,s(s(s(o)))),v3(s(s(o)),o),v4(s(s(o)),s(s(s(o)))),h(s(s(o)),s(o)),s1(s(s(s(o))),s(o)),s2(s(s(s(s(o)))),s(s(o))),s3(s(s(s(s(o)))),o),s4(s(s(s(s(o)))),s(s(s(o)))),e1(s(s(s(s(o)))),s(o)),e2(s(s(s(o))),s(s(o)))),
    inference(spm,[status(thm)],[c_0_13,c_0_21]) ).

cnf(c_0_25,negated_conjecture,
    ~ state(X1,X2,X3,X4,X5,h(s(s(s(o))),s(o)),X6,X7,X8,X9,X10,X11),
    inference(fof_simplification,[status(thm)],[goal_state]) ).

cnf(c_0_26,plain,
    ( ~ state(X1,X2,X3,X4,X5,h(X6,X7),X8,X9,X10,X11,e1(s(X6),X7),e2(s(X6),s(X7)))
    | state(X1,X2,X3,X4,X5,h(s(X6),X7),X8,X9,X10,X11,e1(X6,X7),e2(X6,s(X7))) ),
    c_0_22 ).

cnf(c_0_27,hypothesis,
    state(bb(o,s(o)),v1(o,o),v2(o,s(s(s(o)))),v3(s(s(o)),o),v4(s(s(o)),s(s(s(o)))),h(s(s(o)),s(o)),s1(s(s(s(s(o)))),s(o)),s2(s(s(s(s(o)))),s(s(o))),s3(s(s(s(s(o)))),o),s4(s(s(s(s(o)))),s(s(s(o)))),e1(s(s(s(o))),s(o)),e2(s(s(s(o))),s(s(o)))),
    inference(spm,[status(thm)],[c_0_23,c_0_24]) ).

cnf(c_0_28,negated_conjecture,
    ~ state(X1,X2,X3,X4,X5,h(s(s(s(o))),s(o)),X6,X7,X8,X9,X10,X11),
    c_0_25 ).

cnf(c_0_29,hypothesis,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : PUZ042-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.36  % Computer : n004.cluster.edu
% 0.10/0.36  % Model    : x86_64 x86_64
% 0.10/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36  % Memory   : 8046.5625MB
% 0.10/0.36  % OS       : Linux 6.8.0-71-generic
% 0.10/0.36  % CPULimit : 300
% 0.10/0.36  % WCLimit  : 300
% 0.10/0.36  % DateTime : Mon Sep 21 03:46:50 UTC 2026
% 0.10/0.37  % CPUTime  : 
% 0.10/0.37  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.41  Running first-order theorem proving
% 0.10/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
% 7.59/1.55  % Version: 3.5.1
% 7.59/1.55  % Preprocessing class: FSLSSMSSSSSNFFN.
% 7.59/1.55  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 7.59/1.55  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 7.59/1.55  % Starting new_bool_3 with 300s (1) cores
% 7.59/1.55  % Starting new_bool_1 with 300s (1) cores
% 7.59/1.55  % Starting sh5l with 300s (1) cores
% 7.59/1.55  % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 2176736 completed with status 0
% 7.59/1.55  % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 7.59/1.55  % Preprocessing class: FSLSSMSSSSSNFFN.
% 7.59/1.55  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 7.59/1.55  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 7.59/1.55  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 7.59/1.55  % No SInE strategy applied
% 7.59/1.55  % Search class: FHUNF-FFLF21-MFFFFFNN
% 7.59/1.55  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 7.59/1.55  % Starting SubtermCWHack with 136s (1) cores
% 7.59/1.55  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 7.59/1.55  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S4d with 154s (1) cores
% 7.59/1.55  % Starting new_bool_3 with 154s (1) cores
% 7.59/1.55  % Starting new_bool_1 with 154s (1) cores
% 7.59/1.55  % new_bool_3 with pid 2176745 completed with status 0
% 7.59/1.55  % Result found by new_bool_3
% 7.59/1.55  % Preprocessing class: FSLSSMSSSSSNFFN.
% 7.59/1.55  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 7.59/1.55  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 7.59/1.55  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 7.59/1.55  % No SInE strategy applied
% 7.59/1.55  % Search class: FHUNF-FFLF21-MFFFFFNN
% 7.59/1.55  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 7.59/1.55  % Starting SubtermCWHack with 136s (1) cores
% 7.59/1.55  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 7.59/1.55  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S4d with 154s (1) cores
% 7.59/1.55  % Starting new_bool_3 with 154s (1) cores
% 7.59/1.55  % Preprocessing time       : 0.002 s
% 7.59/1.55  % Presaturation interreduction done
% 7.59/1.55  
% 7.59/1.55  % Proof found!
% 7.59/1.55  % SZS status Unsatisfiable
% 7.59/1.55  % SZS output start CNFRefutation
% See solution above
% 7.59/1.55  % Parsed axioms                        : 43
% 7.59/1.55  % Removed by relevancy pruning/SinE    : 0
% 7.59/1.55  % Initial clauses                      : 43
% 7.59/1.55  % Removed in clause preprocessing      : 0
% 7.59/1.55  % Initial clauses in saturation        : 43
% 7.59/1.55  % Processed clauses                    : 2052
% 7.59/1.55  % ...of these trivial                  : 367
% 7.59/1.55  % ...subsumed                          : 0
% 7.59/1.55  % ...remaining for further processing  : 1685
% 7.59/1.55  % Other redundant clauses eliminated   : 0
% 7.59/1.55  % Clauses deleted for lack of memory   : 0
% 7.59/1.55  % Backward-subsumed                    : 0
% 7.59/1.55  % Backward-rewritten                   : 0
% 7.59/1.55  % Generated clauses                    : 4430
% 7.59/1.55  % ...of the previous two non-redundant : 2405
% 7.59/1.55  % ...aggressively subsumed             : 0
% 7.59/1.55  % Contextual simplify-reflections      : 0
% 7.59/1.55  % Paramodulations                      : 4430
% 7.59/1.55  % Factorizations                       : 0
% 7.59/1.55  % NegExts                              : 0
% 7.59/1.55  % Equation resolutions                 : 0
% 7.59/1.55  % Disequality decompositions           : 0
% 7.59/1.55  % Total rewrite steps                  : 2390
% 7.59/1.55  % ...of those cached                   : 999
% 7.59/1.55  % Propositional unsat checks           : 0
% 7.59/1.55  %    Propositional check models        : 0
% 7.59/1.55  %    Propositional check unsatisfiable : 0
% 7.59/1.55  %    Propositional clauses             : 0
% 7.59/1.55  %    Propositional clauses after purity: 0
% 7.59/1.55  %    Propositional unsat core size     : 0
% 7.59/1.55  %    Propositional preprocessing time  : 0.000
% 7.59/1.55  %    Propositional encoding time       : 0.000
% 7.59/1.55  %    Propositional solver time         : 0.000
% 7.59/1.55  %    Success case prop preproc time    : 0.000
% 7.59/1.55  %    Success case prop encoding time   : 0.000
% 7.59/1.55  %    Success case prop solver time     : 0.000
% 7.59/1.55  % Current number of processed clauses  : 1642
% 7.59/1.55  %    Positive orientable unit clauses  : 1600
% 7.59/1.55  %    Positive unorientable unit clauses: 0
% 7.59/1.55  %    Negative unit clauses             : 1
% 7.59/1.55  %    Non-unit-clauses                  : 41
% 7.59/1.55  % Current number of unprocessed clauses: 439
% 7.59/1.55  % ...number of literals in the above   : 439
% 7.59/1.55  % Current number of archived formulas  : 0
% 7.59/1.55  % Current number of archived clauses   : 43
% 7.59/1.55  % Clause-clause subsumption calls (NU) : 1300
% 7.59/1.55  % Rec. Clause-clause subsumption calls : 1300
% 7.59/1.55  % Non-unit clause-clause subsumptions  : 0
% 7.59/1.55  % Unit Clause-clause subsumption calls : 0
% 7.59/1.55  % Rewrite failures with RHS unbound    : 0
% 7.59/1.55  % BW rewrite match attempts            : 816621
% 7.59/1.55  % BW rewrite match successes           : 0
% 7.59/1.55  % Condensation attempts                : 0
% 7.59/1.55  % Condensation successes               : 0
% 7.59/1.55  % Termbank termtop insertions          : 367251
% 7.59/1.55  % Search garbage collected termcells   : 85
% 7.59/1.55  
% 7.59/1.55  % -------------------------------------------------
% 7.59/1.55  % User time                : 0.969 s
% 7.59/1.55  % System time              : 0.087 s
% 7.59/1.55  % Total time               : 1.055 s
% 7.59/1.55  % Maximum resident set size: 3632 pages
% 7.59/1.55  
% 7.59/1.55  % -------------------------------------------------
% 7.59/1.55  % User time                : 4.773 s
% 7.59/1.55  % System time              : 0.359 s
% 7.59/1.55  % Total time               : 5.132 s
% 7.59/1.55  % Maximum resident set size: 4608 pages
% 7.59/1.55  % E exiting
%------------------------------------------------------------------------------