↑ Up

E---3.5.1.UNS-CRf.s

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

% Computer : n001.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:48:17 PM UTC 2026

% Result   : Unsatisfiable 0.18s 0.52s
% Output   : CNFRefutation 0.18s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    7
% Syntax   : Number of clauses     :   29 (  10 unt;   0 nHn;  12 RR)
%            Number of literals    :   91 (   0 equ;  70 neg)
%            Maximal clause size   :    6 (   3 avg)
%            Maximal term depth    :    9 (   3 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   1 con; 0-2 aty)
%            Number of variables   :   87 (  84 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(clause_1_10,axiom,
    ( ~ 'E'(f(X2),s(s(s(s(s('0'))))))
    | ~ 'E'(f(X1),s(s(s(s('0')))))
    | 'E'(f(X2),s(s(s('0')))) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_1_10) ).

cnf(clause_5_03,axiom,
    ( ~ 'E'(f(X6),s(s(s(s(s('0'))))))
    | ~ 'E'(f(X5),'0')
    | ~ 'E'(f(X4),s('0'))
    | ~ 'E'(f(X3),s(s(s('0'))))
    | ~ 'E'(f(X2),s(s(s(s('0')))))
    | ~ 'E'(f(X1),s(s('0'))) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_5_03) ).

cnf(clause_6_04,axiom,
    'E'(f(X1),s(s(s(s('0'))))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_6_04) ).

cnf(clause_8_05,axiom,
    'E'(f(X1),s(s(s(s(s('0')))))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_8_05) ).

cnf(clause_4_12,axiom,
    ( ~ 'E'(f(X3),s(s(s('0'))))
    | ~ 'E'(f(X2),s(s(s(s(s('0'))))))
    | ~ 'E'(f(X1),s(s(s(s('0')))))
    | 'E'(f('AP'(s(s(s(s(s(s('0')))))),X4)),s(s('0'))) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_4_12) ).

cnf(clause_12_09,axiom,
    ( ~ 'E'(f(X4),s(s('0')))
    | ~ 'E'(f(X3),s(s(s('0'))))
    | ~ 'E'(f(X2),s(s(s(s(s('0'))))))
    | ~ 'E'(f(X1),s(s(s(s('0')))))
    | 'E'(f('AP'(s(s(s(s(s(s('0')))))),X5)),s('0')) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_12_09) ).

cnf(clause_2_07,axiom,
    ( ~ 'E'(f(X5),s(s(s(s(s('0'))))))
    | ~ 'E'(f(X4),s('0'))
    | ~ 'E'(f(X3),s(s(s('0'))))
    | ~ 'E'(f(X2),s(s(s(s('0')))))
    | ~ 'E'(f(X1),s(s('0')))
    | 'E'(f('AP'(s(s(s(s(s(s('0')))))),X6)),'0') ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_2_07) ).

cnf(c_0_7,plain,
    ( ~ 'E'(f(X2),s(s(s(s(s('0'))))))
    | ~ 'E'(f(X1),s(s(s(s('0')))))
    | 'E'(f(X2),s(s(s('0')))) ),
    inference(fof_simplification,[status(thm)],[clause_1_10]) ).

cnf(c_0_8,plain,
    ( ~ 'E'(f(X6),s(s(s(s(s('0'))))))
    | ~ 'E'(f(X5),'0')
    | ~ 'E'(f(X4),s('0'))
    | ~ 'E'(f(X3),s(s(s('0'))))
    | ~ 'E'(f(X2),s(s(s(s('0')))))
    | ~ 'E'(f(X1),s(s('0'))) ),
    inference(fof_simplification,[status(thm)],[clause_5_03]) ).

cnf(c_0_9,plain,
    ( ~ 'E'(f(X2),s(s(s(s(s('0'))))))
    | ~ 'E'(f(X1),s(s(s(s('0')))))
    | 'E'(f(X2),s(s(s('0')))) ),
    c_0_7 ).

cnf(c_0_10,axiom,
    'E'(f(X1),s(s(s(s('0'))))),
    clause_6_04 ).

cnf(c_0_11,axiom,
    'E'(f(X1),s(s(s(s(s('0')))))),
    clause_8_05 ).

cnf(c_0_12,plain,
    ( ~ 'E'(f(X3),s(s(s('0'))))
    | ~ 'E'(f(X2),s(s(s(s(s('0'))))))
    | ~ 'E'(f(X1),s(s(s(s('0')))))
    | 'E'(f('AP'(s(s(s(s(s(s('0')))))),X4)),s(s('0'))) ),
    inference(fof_simplification,[status(thm)],[clause_4_12]) ).

cnf(c_0_13,plain,
    ( ~ 'E'(f(X4),s(s('0')))
    | ~ 'E'(f(X3),s(s(s('0'))))
    | ~ 'E'(f(X2),s(s(s(s(s('0'))))))
    | ~ 'E'(f(X1),s(s(s(s('0')))))
    | 'E'(f('AP'(s(s(s(s(s(s('0')))))),X5)),s('0')) ),
    inference(fof_simplification,[status(thm)],[clause_12_09]) ).

cnf(c_0_14,plain,
    ( ~ 'E'(f(X6),s(s(s(s(s('0'))))))
    | ~ 'E'(f(X5),'0')
    | ~ 'E'(f(X4),s('0'))
    | ~ 'E'(f(X3),s(s(s('0'))))
    | ~ 'E'(f(X2),s(s(s(s('0')))))
    | ~ 'E'(f(X1),s(s('0'))) ),
    c_0_8 ).

cnf(c_0_15,plain,
    'E'(f(X1),s(s(s('0')))),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_10]),c_0_11])]) ).

cnf(c_0_16,plain,
    ( ~ 'E'(f(X3),s(s(s('0'))))
    | ~ 'E'(f(X2),s(s(s(s(s('0'))))))
    | ~ 'E'(f(X1),s(s(s(s('0')))))
    | 'E'(f('AP'(s(s(s(s(s(s('0')))))),X4)),s(s('0'))) ),
    c_0_12 ).

cnf(c_0_17,plain,
    ( ~ 'E'(f(X4),s(s('0')))
    | ~ 'E'(f(X3),s(s(s('0'))))
    | ~ 'E'(f(X2),s(s(s(s(s('0'))))))
    | ~ 'E'(f(X1),s(s(s(s('0')))))
    | 'E'(f('AP'(s(s(s(s(s(s('0')))))),X5)),s('0')) ),
    c_0_13 ).

cnf(c_0_18,plain,
    ( ~ 'E'(f(X3),'0')
    | ~ 'E'(f(X2),s('0'))
    | ~ 'E'(f(X1),s(s('0'))) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_15]),c_0_10]),c_0_11])]) ).

cnf(c_0_19,plain,
    'E'(f('AP'(s(s(s(s(s(s('0')))))),X1)),s(s('0'))),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_15]),c_0_10]),c_0_11])]) ).

cnf(c_0_20,plain,
    ( ~ 'E'(f(X2),s(s('0')))
    | 'E'(f('AP'(s(s(s(s(s(s('0')))))),X1)),s('0')) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_15]),c_0_10]),c_0_11])]) ).

cnf(c_0_21,plain,
    ( ~ 'E'(f(X5),s(s(s(s(s('0'))))))
    | ~ 'E'(f(X4),s('0'))
    | ~ 'E'(f(X3),s(s(s('0'))))
    | ~ 'E'(f(X2),s(s(s(s('0')))))
    | ~ 'E'(f(X1),s(s('0')))
    | 'E'(f('AP'(s(s(s(s(s(s('0')))))),X6)),'0') ),
    inference(fof_simplification,[status(thm)],[clause_2_07]) ).

cnf(c_0_22,plain,
    ( ~ 'E'(f(X2),'0')
    | ~ 'E'(f(X1),s('0')) ),
    inference(spm,[status(thm)],[c_0_18,c_0_19]) ).

cnf(c_0_23,plain,
    'E'(f('AP'(s(s(s(s(s(s('0')))))),X1)),s('0')),
    inference(spm,[status(thm)],[c_0_20,c_0_19]) ).

cnf(c_0_24,plain,
    ( ~ 'E'(f(X5),s(s(s(s(s('0'))))))
    | ~ 'E'(f(X4),s('0'))
    | ~ 'E'(f(X3),s(s(s('0'))))
    | ~ 'E'(f(X2),s(s(s(s('0')))))
    | ~ 'E'(f(X1),s(s('0')))
    | 'E'(f('AP'(s(s(s(s(s(s('0')))))),X6)),'0') ),
    c_0_21 ).

cnf(c_0_25,plain,
    ~ 'E'(f(X1),'0'),
    inference(spm,[status(thm)],[c_0_22,c_0_23]) ).

cnf(c_0_26,plain,
    ( ~ 'E'(f(X2),s('0'))
    | ~ 'E'(f(X1),s(s('0'))) ),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_15]),c_0_10]),c_0_11])]),c_0_25]) ).

cnf(c_0_27,plain,
    ~ 'E'(f(X1),s('0')),
    inference(spm,[status(thm)],[c_0_26,c_0_19]) ).

cnf(c_0_28,plain,
    $false,
    inference(sr,[status(thm)],[c_0_23,c_0_27]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYO633-1 : TPTP v9.3.1. Released v7.1.0.
% 0.00/0.04  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/0.38  % Computer : n001.cluster.edu
% 0.15/0.38  % Model    : x86_64 x86_64
% 0.15/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.38  % Memory   : 8046.5625MB
% 0.15/0.38  % OS       : Linux 6.8.0-71-generic
% 0.15/0.38  % CPULimit : 300
% 0.15/0.38  % WCLimit  : 300
% 0.15/0.38  % DateTime : Mon Sep 21 12:12:00 UTC 2026
% 0.15/0.39  % CPUTime  : 
% 0.15/0.39  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.18/0.47  Running first-order theorem proving
% 0.18/0.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.18/0.52  % Version: 3.5.1
% 0.18/0.52  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.18/0.52  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.52  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.18/0.52  % Starting new_bool_3 with 300s (1) cores
% 0.18/0.52  % Starting new_bool_1 with 300s (1) cores
% 0.18/0.52  % Starting sh5l with 300s (1) cores
% 0.18/0.52  % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 3071457 completed with status 0
% 0.18/0.52  % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.18/0.52  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.18/0.52  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.52  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.18/0.52  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.18/0.52  % No SInE strategy applied
% 0.18/0.52  % Search class: FHHNM-FFMF21-DFFFFFNN
% 0.18/0.52  % partial match(1): FHHNM-FFMS21-DFFFFFNN
% 0.18/0.52  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.18/0.52  % Starting SubtermCWHack with 136s (1) cores
% 0.18/0.52  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.18/0.52  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 136s (1) cores
% 0.18/0.52  % Starting new_bool_3 with 136s (1) cores
% 0.18/0.52  % Starting new_bool_1 with 136s (1) cores
% 0.18/0.52  % SubtermCWHack with pid 3071458 completed with status 0
% 0.18/0.52  % Result found by SubtermCWHack
% 0.18/0.52  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.18/0.52  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.52  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.18/0.52  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.18/0.52  % No SInE strategy applied
% 0.18/0.52  % Search class: FHHNM-FFMF21-DFFFFFNN
% 0.18/0.52  % partial match(1): FHHNM-FFMS21-DFFFFFNN
% 0.18/0.52  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.18/0.52  % Starting SubtermCWHack with 136s (1) cores
% 0.18/0.52  % Preprocessing time       : 0.002 s
% 0.18/0.52  
% 0.18/0.52  % Proof found!
% 0.18/0.52  % SZS status Unsatisfiable
% 0.18/0.52  % SZS output start CNFRefutation
% See solution above
% 0.18/0.52  % Parsed axioms                        : 13
% 0.18/0.52  % Removed by relevancy pruning/SinE    : 0
% 0.18/0.52  % Initial clauses                      : 13
% 0.18/0.52  % Removed in clause preprocessing      : 0
% 0.18/0.52  % Initial clauses in saturation        : 13
% 0.18/0.52  % Processed clauses                    : 17
% 0.18/0.52  % ...of these trivial                  : 0
% 0.18/0.52  % ...subsumed                          : 0
% 0.18/0.52  % ...remaining for further processing  : 17
% 0.18/0.52  % Other redundant clauses eliminated   : 0
% 0.18/0.52  % Clauses deleted for lack of memory   : 0
% 0.18/0.52  % Backward-subsumed                    : 3
% 0.18/0.52  % Backward-rewritten                   : 2
% 0.18/0.52  % Generated clauses                    : 6
% 0.18/0.52  % ...of the previous two non-redundant : 5
% 0.18/0.52  % ...aggressively subsumed             : 0
% 0.18/0.52  % Contextual simplify-reflections      : 0
% 0.18/0.52  % Paramodulations                      : 5
% 0.18/0.52  % Factorizations                       : 0
% 0.18/0.52  % NegExts                              : 0
% 0.18/0.52  % Equation resolutions                 : 0
% 0.18/0.52  % Disequality decompositions           : 0
% 0.18/0.52  % Total rewrite steps                  : 24
% 0.18/0.52  % ...of those cached                   : 16
% 0.18/0.52  % Propositional unsat checks           : 0
% 0.18/0.52  %    Propositional check models        : 0
% 0.18/0.52  %    Propositional check unsatisfiable : 0
% 0.18/0.52  %    Propositional clauses             : 0
% 0.18/0.52  %    Propositional clauses after purity: 0
% 0.18/0.52  %    Propositional unsat core size     : 0
% 0.18/0.52  %    Propositional preprocessing time  : 0.000
% 0.18/0.52  %    Propositional encoding time       : 0.000
% 0.18/0.52  %    Propositional solver time         : 0.000
% 0.18/0.52  %    Success case prop preproc time    : 0.000
% 0.18/0.52  %    Success case prop encoding time   : 0.000
% 0.18/0.52  %    Success case prop solver time     : 0.000
% 0.18/0.52  % Current number of processed clauses  : 11
% 0.18/0.52  %    Positive orientable unit clauses  : 9
% 0.18/0.52  %    Positive unorientable unit clauses: 0
% 0.18/0.52  %    Negative unit clauses             : 2
% 0.18/0.52  %    Non-unit-clauses                  : 0
% 0.18/0.52  % Current number of unprocessed clauses: 1
% 0.18/0.52  % ...number of literals in the above   : 6
% 0.18/0.52  % Current number of archived formulas  : 0
% 0.18/0.52  % Current number of archived clauses   : 6
% 0.18/0.52  % Clause-clause subsumption calls (NU) : 2
% 0.18/0.52  % Rec. Clause-clause subsumption calls : 2
% 0.18/0.52  % Non-unit clause-clause subsumptions  : 1
% 0.18/0.52  % Unit Clause-clause subsumption calls : 2
% 0.18/0.52  % Rewrite failures with RHS unbound    : 0
% 0.18/0.52  % BW rewrite match attempts            : 9
% 0.18/0.52  % BW rewrite match successes           : 2
% 0.18/0.52  % Condensation attempts                : 0
% 0.18/0.52  % Condensation successes               : 0
% 0.18/0.52  % Termbank termtop insertions          : 1359
% 0.18/0.52  % Search garbage collected termcells   : 52
% 0.18/0.52  
% 0.18/0.52  % -------------------------------------------------
% 0.18/0.52  % User time                : 0.003 s
% 0.18/0.52  % System time              : 0.007 s
% 0.18/0.52  % Total time               : 0.010 s
% 0.18/0.52  % Maximum resident set size: 3652 pages
% 0.18/0.52  
% 0.18/0.52  % -------------------------------------------------
% 0.18/0.52  % User time                : 0.015 s
% 0.18/0.52  % System time              : 0.019 s
% 0.18/0.52  % Total time               : 0.034 s
% 0.18/0.52  % Maximum resident set size: 4608 pages
% 0.18/0.52  % E exiting
%------------------------------------------------------------------------------