TSTP Solution File: SYO633-1 by E---3.1.00

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1.00
% Problem  : SYO633-1 : TPTP v8.1.2. Released v7.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n025.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Sat May  4 10:35:05 EDT 2024

% Result   : Unsatisfiable 0.21s 0.49s
% Output   : CNFRefutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    7
% Syntax   : Number of clauses     :   27 (   9 unt;   0 nHn;  10 RR)
%            Number of literals    :   88 (   0 equ;  67 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   :   84 (  81 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(clause_1_10,axiom,
    ( 'E'(f(X2),s(s(s('0'))))
    | ~ 'E'(f(X1),s(s(s(s('0')))))
    | ~ 'E'(f(X2),s(s(s(s(s('0')))))) ),
    file('/export/starexec/sandbox/tmp/tmp.98i0BpFhxR/E---3.1_2969.p',clause_1_10) ).

cnf(clause_5_03,axiom,
    ( ~ 'E'(f(X1),s(s('0')))
    | ~ 'E'(f(X2),s(s(s(s('0')))))
    | ~ 'E'(f(X3),s(s(s('0'))))
    | ~ 'E'(f(X4),s('0'))
    | ~ 'E'(f(X5),'0')
    | ~ 'E'(f(X6),s(s(s(s(s('0')))))) ),
    file('/export/starexec/sandbox/tmp/tmp.98i0BpFhxR/E---3.1_2969.p',clause_5_03) ).

cnf(clause_6_04,axiom,
    'E'(f(X1),s(s(s(s('0'))))),
    file('/export/starexec/sandbox/tmp/tmp.98i0BpFhxR/E---3.1_2969.p',clause_6_04) ).

cnf(clause_8_05,axiom,
    'E'(f(X1),s(s(s(s(s('0')))))),
    file('/export/starexec/sandbox/tmp/tmp.98i0BpFhxR/E---3.1_2969.p',clause_8_05) ).

cnf(clause_12_09,axiom,
    ( 'E'(f('AP'(s(s(s(s(s(s('0')))))),X5)),s('0'))
    | ~ 'E'(f(X1),s(s(s(s('0')))))
    | ~ 'E'(f(X2),s(s(s(s(s('0'))))))
    | ~ 'E'(f(X3),s(s(s('0'))))
    | ~ 'E'(f(X4),s(s('0'))) ),
    file('/export/starexec/sandbox/tmp/tmp.98i0BpFhxR/E---3.1_2969.p',clause_12_09) ).

cnf(clause_4_12,axiom,
    ( 'E'(f('AP'(s(s(s(s(s(s('0')))))),X4)),s(s('0')))
    | ~ 'E'(f(X1),s(s(s(s('0')))))
    | ~ 'E'(f(X2),s(s(s(s(s('0'))))))
    | ~ 'E'(f(X3),s(s(s('0')))) ),
    file('/export/starexec/sandbox/tmp/tmp.98i0BpFhxR/E---3.1_2969.p',clause_4_12) ).

cnf(clause_2_07,axiom,
    ( 'E'(f('AP'(s(s(s(s(s(s('0')))))),X6)),'0')
    | ~ 'E'(f(X1),s(s('0')))
    | ~ 'E'(f(X2),s(s(s(s('0')))))
    | ~ 'E'(f(X3),s(s(s('0'))))
    | ~ 'E'(f(X4),s('0'))
    | ~ 'E'(f(X5),s(s(s(s(s('0')))))) ),
    file('/export/starexec/sandbox/tmp/tmp.98i0BpFhxR/E---3.1_2969.p',clause_2_07) ).

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

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

cnf(c_0_9,plain,
    ( 'E'(f(X2),s(s(s('0'))))
    | ~ 'E'(f(X1),s(s(s(s('0')))))
    | ~ 'E'(f(X2),s(s(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('AP'(s(s(s(s(s(s('0')))))),X5)),s('0'))
    | ~ 'E'(f(X1),s(s(s(s('0')))))
    | ~ 'E'(f(X2),s(s(s(s(s('0'))))))
    | ~ 'E'(f(X3),s(s(s('0'))))
    | ~ 'E'(f(X4),s(s('0'))) ),
    inference(fof_simplification,[status(thm)],[clause_12_09]) ).

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

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

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

cnf(c_0_16,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_17,plain,
    ( 'E'(f('AP'(s(s(s(s(s(s('0')))))),X5)),s('0'))
    | ~ 'E'(f(X1),s(s(s(s('0')))))
    | ~ 'E'(f(X2),s(s(s(s(s('0'))))))
    | ~ 'E'(f(X3),s(s(s('0'))))
    | ~ 'E'(f(X4),s(s('0'))) ),
    c_0_12 ).

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

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

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

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

cnf(c_0_22,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_18,c_0_16]),c_0_10]),c_0_11])]) ).

cnf(c_0_23,plain,
    ( ~ 'E'(f(X1),s(s('0')))
    | ~ 'E'(f(X2),s('0')) ),
    inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_16]),c_0_10]),c_0_11])]),c_0_20]) ).

cnf(c_0_24,plain,
    'E'(f('AP'(s(s(s(s(s(s('0')))))),X1)),s('0')),
    inference(spm,[status(thm)],[c_0_21,c_0_22]) ).

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

cnf(c_0_26,plain,
    $false,
    inference(sr,[status(thm)],[c_0_24,c_0_25]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : SYO633-1 : TPTP v8.1.2. Released v7.1.0.
% 0.07/0.14  % Command    : run_E %s %d THM
% 0.13/0.35  % Computer : n025.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit   : 300
% 0.13/0.35  % WCLimit    : 300
% 0.13/0.35  % DateTime   : Fri May  3 09:58:43 EDT 2024
% 0.13/0.35  % CPUTime    : 
% 0.21/0.48  Running first-order theorem proving
% 0.21/0.48  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/tmp/tmp.98i0BpFhxR/E---3.1_2969.p
% 0.21/0.49  # Version: 3.1.0
% 0.21/0.49  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.49  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.49  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.49  # Starting new_bool_3 with 300s (1) cores
% 0.21/0.49  # Starting new_bool_1 with 300s (1) cores
% 0.21/0.49  # Starting sh5l with 300s (1) cores
% 0.21/0.49  # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 3082 completed with status 0
% 0.21/0.49  # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.21/0.49  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.49  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.49  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.49  # No SInE strategy applied
% 0.21/0.49  # Search class: FHHNM-FFMF21-DFFFFFNN
% 0.21/0.49  # partial match(1): FHHNM-FFMS21-DFFFFFNN
% 0.21/0.49  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.49  # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 811s (1) cores
% 0.21/0.49  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.21/0.49  # Starting new_bool_3 with 136s (1) cores
% 0.21/0.49  # Starting new_bool_1 with 136s (1) cores
% 0.21/0.49  # Starting sh5l with 136s (1) cores
% 0.21/0.49  # G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with pid 3092 completed with status 0
% 0.21/0.49  # Result found by G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN
% 0.21/0.49  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.49  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.49  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.49  # No SInE strategy applied
% 0.21/0.49  # Search class: FHHNM-FFMF21-DFFFFFNN
% 0.21/0.49  # partial match(1): FHHNM-FFMS21-DFFFFFNN
% 0.21/0.49  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.49  # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 811s (1) cores
% 0.21/0.49  # Preprocessing time       : 0.002 s
% 0.21/0.49  
% 0.21/0.49  # Proof found!
% 0.21/0.49  # SZS status Unsatisfiable
% 0.21/0.49  # SZS output start CNFRefutation
% See solution above
% 0.21/0.49  # Parsed axioms                        : 13
% 0.21/0.49  # Removed by relevancy pruning/SinE    : 0
% 0.21/0.49  # Initial clauses                      : 13
% 0.21/0.49  # Removed in clause preprocessing      : 0
% 0.21/0.49  # Initial clauses in saturation        : 13
% 0.21/0.49  # Processed clauses                    : 15
% 0.21/0.49  # ...of these trivial                  : 0
% 0.21/0.49  # ...subsumed                          : 0
% 0.21/0.49  # ...remaining for further processing  : 15
% 0.21/0.49  # Other redundant clauses eliminated   : 0
% 0.21/0.49  # Clauses deleted for lack of memory   : 0
% 0.21/0.49  # Backward-subsumed                    : 4
% 0.21/0.49  # Backward-rewritten                   : 0
% 0.21/0.49  # Generated clauses                    : 6
% 0.21/0.49  # ...of the previous two non-redundant : 5
% 0.21/0.49  # ...aggressively subsumed             : 0
% 0.21/0.49  # Contextual simplify-reflections      : 1
% 0.21/0.49  # Paramodulations                      : 5
% 0.21/0.49  # Factorizations                       : 0
% 0.21/0.49  # NegExts                              : 0
% 0.21/0.49  # Equation resolutions                 : 0
% 0.21/0.49  # Disequality decompositions           : 0
% 0.21/0.49  # Total rewrite steps                  : 25
% 0.21/0.49  # ...of those cached                   : 18
% 0.21/0.49  # Propositional unsat checks           : 0
% 0.21/0.49  #    Propositional check models        : 0
% 0.21/0.49  #    Propositional check unsatisfiable : 0
% 0.21/0.49  #    Propositional clauses             : 0
% 0.21/0.49  #    Propositional clauses after purity: 0
% 0.21/0.49  #    Propositional unsat core size     : 0
% 0.21/0.49  #    Propositional preprocessing time  : 0.000
% 0.21/0.49  #    Propositional encoding time       : 0.000
% 0.21/0.49  #    Propositional solver time         : 0.000
% 0.21/0.49  #    Success case prop preproc time    : 0.000
% 0.21/0.49  #    Success case prop encoding time   : 0.000
% 0.21/0.49  #    Success case prop solver time     : 0.000
% 0.21/0.49  # Current number of processed clauses  : 10
% 0.21/0.49  #    Positive orientable unit clauses  : 8
% 0.21/0.49  #    Positive unorientable unit clauses: 0
% 0.21/0.49  #    Negative unit clauses             : 1
% 0.21/0.49  #    Non-unit-clauses                  : 1
% 0.21/0.49  # Current number of unprocessed clauses: 3
% 0.21/0.49  # ...number of literals in the above   : 5
% 0.21/0.49  # Current number of archived formulas  : 0
% 0.21/0.49  # Current number of archived clauses   : 5
% 0.21/0.49  # Clause-clause subsumption calls (NU) : 6
% 0.21/0.49  # Rec. Clause-clause subsumption calls : 6
% 0.21/0.49  # Non-unit clause-clause subsumptions  : 3
% 0.21/0.49  # Unit Clause-clause subsumption calls : 3
% 0.21/0.49  # Rewrite failures with RHS unbound    : 0
% 0.21/0.49  # BW rewrite match attempts            : 7
% 0.21/0.49  # BW rewrite match successes           : 1
% 0.21/0.49  # Condensation attempts                : 0
% 0.21/0.49  # Condensation successes               : 0
% 0.21/0.49  # Termbank termtop insertions          : 1288
% 0.21/0.49  # Search garbage collected termcells   : 52
% 0.21/0.49  
% 0.21/0.49  # -------------------------------------------------
% 0.21/0.49  # User time                : 0.006 s
% 0.21/0.49  # System time              : 0.001 s
% 0.21/0.49  # Total time               : 0.007 s
% 0.21/0.49  # Maximum resident set size: 1676 pages
% 0.21/0.49  
% 0.21/0.49  # -------------------------------------------------
% 0.21/0.49  # User time                : 0.019 s
% 0.21/0.49  # System time              : 0.006 s
% 0.21/0.49  # Total time               : 0.025 s
% 0.21/0.49  # Maximum resident set size: 1708 pages
% 0.21/0.49  % E---3.1 exiting
% 0.21/0.50  % E exiting
%------------------------------------------------------------------------------