↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : SYN986+1.002 : TPTP v9.3.1. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox/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 03:31:02 PM UTC 2026

% Result   : Theorem 0.17s 10.50s
% Output   : CNFRefutation 0.17s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   18 (   5 unt;   0 def)
%            Number of atoms       :   40 (   0 equ)
%            Maximal formula atoms :    3 (   2 avg)
%            Number of connectives :   44 (  22   ~;  16   |;   4   &)
%                                         (   0 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-3 aty)
%            Number of functors    :    2 (   2 usr;   1 con; 0-1 aty)
%            Number of variables   :   42 (   4 sgn  13   !;   6   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(hyp2,axiom,
    ! [X1,X2,X3,X4] :
      ( r(X1,X2,X3)
     => ( r(X3,X2,X4)
       => r(X1,succ(X2),X4) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SYN002+0.ax',hyp2) ).

fof(hyp1,axiom,
    ! [X1] : r(X1,zero,succ(X1)),
    file('/export/starexec/sandbox/benchmark/Axioms/SYN002+0.ax',hyp1) ).

fof(ck,conjecture,
    ? [X5,X4,X6] :
      ( r(zero,X4,X6)
      & r(zero,X5,X4)
      & r(zero,zero,X5) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ck) ).

fof(c_0_3,plain,
    ! [X8,X9,X10,X11] :
      ( r(X8,succ(X9),X11)
      | ~ r(X10,X9,X11)
      | ~ r(X8,X9,X10) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[hyp2])])]) ).

fof(c_0_4,plain,
    ! [X7] : r(X7,zero,succ(X7)),
    inference(variable_rename,[status(thm)],[hyp1]) ).

fof(c_0_5,negated_conjecture,
    ~ ? [X5,X4,X6] :
        ( r(zero,X4,X6)
        & r(zero,X5,X4)
        & r(zero,zero,X5) ),
    inference(assume_negation,[status(cth)],[ck]) ).

cnf(c_0_6,plain,
    ( ~ r(X3,X2,X4)
    | ~ r(X1,X2,X3)
    | r(X1,succ(X2),X4) ),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

cnf(c_0_7,plain,
    r(X1,zero,succ(X1)),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

fof(c_0_8,negated_conjecture,
    ! [X12,X13,X14] :
      ( ~ r(zero,X13,X14)
      | ~ r(zero,X12,X13)
      | ~ r(zero,zero,X12) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).

cnf(c_0_9,plain,
    ( ~ r(X1,zero,X2)
    | r(X1,succ(zero),succ(X2)) ),
    inference(spm,[status(thm)],[c_0_6,c_0_7]) ).

cnf(c_0_10,negated_conjecture,
    ( ~ r(zero,X2,X3)
    | ~ r(zero,X1,X2)
    | ~ r(zero,zero,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_11,plain,
    ( ~ r(X3,zero,X2)
    | ~ r(X1,succ(zero),X3)
    | r(X1,succ(succ(zero)),succ(X2)) ),
    inference(spm,[status(thm)],[c_0_6,c_0_9]) ).

cnf(c_0_12,negated_conjecture,
    ( ~ r(zero,X1,X2)
    | ~ r(zero,succ(zero),X1) ),
    inference(spm,[status(thm)],[c_0_10,c_0_7]) ).

cnf(c_0_13,plain,
    ( ~ r(X1,zero,X3)
    | ~ r(succ(X3),zero,X2)
    | r(X1,succ(succ(zero)),succ(X2)) ),
    inference(spm,[status(thm)],[c_0_11,c_0_9]) ).

cnf(c_0_14,negated_conjecture,
    ( ~ r(zero,zero,X1)
    | ~ r(zero,succ(X1),X2) ),
    inference(spm,[status(thm)],[c_0_12,c_0_9]) ).

cnf(c_0_15,plain,
    ( ~ r(X1,zero,X2)
    | r(X1,succ(succ(zero)),succ(succ(succ(X2)))) ),
    inference(spm,[status(thm)],[c_0_13,c_0_7]) ).

cnf(c_0_16,negated_conjecture,
    ~ r(zero,zero,X1),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_7])]) ).

cnf(c_0_17,negated_conjecture,
    $false,
    inference(spm,[status(thm)],[c_0_16,c_0_7]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SYN986+1.002 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/10.39  % Computer : n005.cluster.edu
% 0.13/10.39  % Model    : x86_64 x86_64
% 0.13/10.39  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/10.39  % Memory   : 8046.5625MB
% 0.13/10.39  % OS       : Linux 6.8.0-71-generic
% 0.13/10.40  % CPULimit : 300
% 0.13/10.40  % WCLimit  : 300
% 0.13/10.40  % DateTime : Mon Sep 21 11:31:59 UTC 2026
% 0.17/10.40  % CPUTime  : 
% 0.17/10.40  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.17/10.47  Running first-order theorem proving
% 0.17/10.47  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.17/10.50  % Version: 3.5.1
% 0.17/10.50  % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.17/10.50  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/10.50  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.17/10.50  % Starting new_bool_3 with 300s (1) cores
% 0.17/10.50  % Starting new_bool_1 with 300s (1) cores
% 0.17/10.50  % Starting sh5l with 300s (1) cores
% 0.17/10.50  % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 3345962 completed with status 0
% 0.17/10.50  % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.17/10.50  % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.17/10.50  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/10.50  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.17/10.50  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.17/10.50  % No SInE strategy applied
% 0.17/10.50  % Search class: FHHNF-FFSF11-SFFFFFNN
% 0.17/10.50  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/10.50  % Starting SubtermCWHack with 136s (1) cores
% 0.17/10.50  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.17/10.50  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.17/10.50  % Starting new_bool_3 with 136s (1) cores
% 0.17/10.50  % Starting new_bool_1 with 136s (1) cores
% 0.17/10.50  % SubtermCWHack with pid 3345966 completed with status 0
% 0.17/10.50  % Result found by SubtermCWHack
% 0.17/10.50  % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.17/10.50  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/10.50  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.17/10.50  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.17/10.50  % No SInE strategy applied
% 0.17/10.50  % Search class: FHHNF-FFSF11-SFFFFFNN
% 0.17/10.50  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/10.50  % Starting SubtermCWHack with 136s (1) cores
% 0.17/10.50  % Preprocessing time       : 0.001 s
% 0.17/10.50  
% 0.17/10.50  % Proof found!
% 0.17/10.50  % SZS status Theorem
% 0.17/10.50  % SZS output start CNFRefutation
% See solution above
% 0.17/10.50  % Parsed axioms                        : 3
% 0.17/10.50  % Removed by relevancy pruning/SinE    : 0
% 0.17/10.50  % Initial clauses                      : 3
% 0.17/10.50  % Removed in clause preprocessing      : 0
% 0.17/10.50  % Initial clauses in saturation        : 3
% 0.17/10.50  % Processed clauses                    : 11
% 0.17/10.50  % ...of these trivial                  : 0
% 0.17/10.50  % ...subsumed                          : 0
% 0.17/10.50  % ...remaining for further processing  : 11
% 0.17/10.50  % Other redundant clauses eliminated   : 0
% 0.17/10.50  % Clauses deleted for lack of memory   : 0
% 0.17/10.50  % Backward-subsumed                    : 3
% 0.17/10.50  % Backward-rewritten                   : 0
% 0.17/10.50  % Generated clauses                    : 10
% 0.17/10.50  % ...of the previous two non-redundant : 9
% 0.17/10.50  % ...aggressively subsumed             : 0
% 0.17/10.50  % Contextual simplify-reflections      : 0
% 0.17/10.50  % Paramodulations                      : 10
% 0.17/10.50  % Factorizations                       : 0
% 0.17/10.50  % NegExts                              : 0
% 0.17/10.50  % Equation resolutions                 : 0
% 0.17/10.50  % Disequality decompositions           : 0
% 0.17/10.50  % Total rewrite steps                  : 1
% 0.17/10.50  % ...of those cached                   : 0
% 0.17/10.50  % Propositional unsat checks           : 0
% 0.17/10.50  %    Propositional check models        : 0
% 0.17/10.50  %    Propositional check unsatisfiable : 0
% 0.17/10.50  %    Propositional clauses             : 0
% 0.17/10.50  %    Propositional clauses after purity: 0
% 0.17/10.50  %    Propositional unsat core size     : 0
% 0.17/10.50  %    Propositional preprocessing time  : 0.000
% 0.17/10.50  %    Propositional encoding time       : 0.000
% 0.17/10.50  %    Propositional solver time         : 0.000
% 0.17/10.50  %    Success case prop preproc time    : 0.000
% 0.17/10.50  %    Success case prop encoding time   : 0.000
% 0.17/10.50  %    Success case prop solver time     : 0.000
% 0.17/10.50  % Current number of processed clauses  : 8
% 0.17/10.50  %    Positive orientable unit clauses  : 1
% 0.17/10.50  %    Positive unorientable unit clauses: 0
% 0.17/10.50  %    Negative unit clauses             : 1
% 0.17/10.50  %    Non-unit-clauses                  : 6
% 0.17/10.50  % Current number of unprocessed clauses: 1
% 0.17/10.50  % ...number of literals in the above   : 3
% 0.17/10.50  % Current number of archived formulas  : 0
% 0.17/10.50  % Current number of archived clauses   : 3
% 0.17/10.50  % Clause-clause subsumption calls (NU) : 21
% 0.17/10.50  % Rec. Clause-clause subsumption calls : 15
% 0.17/10.50  % Non-unit clause-clause subsumptions  : 0
% 0.17/10.50  % Unit Clause-clause subsumption calls : 6
% 0.17/10.50  % Rewrite failures with RHS unbound    : 0
% 0.17/10.50  % BW rewrite match attempts            : 0
% 0.17/10.50  % BW rewrite match successes           : 0
% 0.17/10.50  % Condensation attempts                : 0
% 0.17/10.50  % Condensation successes               : 0
% 0.17/10.50  % Termbank termtop insertions          : 494
% 0.17/10.50  % Search garbage collected termcells   : 53
% 0.17/10.50  
% 0.17/10.50  % -------------------------------------------------
% 0.17/10.50  % User time                : 0.004 s
% 0.17/10.50  % System time              : 0.002 s
% 0.17/10.50  % Total time               : 0.006 s
% 0.17/10.50  % Maximum resident set size: 3584 pages
% 0.17/10.50  
% 0.17/10.50  % -------------------------------------------------
% 0.17/10.50  % User time                : 0.012 s
% 0.17/10.50  % System time              : 0.013 s
% 0.17/10.50  % Total time               : 0.024 s
% 0.17/10.50  % Maximum resident set size: 4864 pages
% 0.17/10.50  % E exiting
%------------------------------------------------------------------------------