TSTP Solution File: SYO617-1 by E-SAT---3.1

View Problem - Process Solution

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

% Computer : n004.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 : 2400s
% WCLimit  : 300s
% DateTime : Tue Oct 10 20:49:51 EDT 2023

% Result   : Unsatisfiable 0.20s 0.51s
% Output   : CNFRefutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   17
%            Number of leaves      :    7
% Syntax   : Number of clauses     :   45 (  14 unt;   4 nHn;  27 RR)
%            Number of literals    :   87 (   0 equ;  58 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    7 (   2 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   3 con; 0-2 aty)
%            Number of variables   :  106 (  58 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(sos_02,axiom,
    ( le(X1,X3)
    | ~ le(max(X1,X2),X3) ),
    file('/export/starexec/sandbox2/tmp/tmp.LZZS1jPVzB/E---3.1_18613.p',sos_02) ).

cnf(sos_01,axiom,
    le(X1,X1),
    file('/export/starexec/sandbox2/tmp/tmp.LZZS1jPVzB/E---3.1_18613.p',sos_01) ).

cnf(sos_03,axiom,
    ( le(X2,X3)
    | ~ le(max(X1,X2),X3) ),
    file('/export/starexec/sandbox2/tmp/tmp.LZZS1jPVzB/E---3.1_18613.p',sos_03) ).

cnf(sos_07,axiom,
    ( ~ eq(f(X1),a2)
    | ~ eq(f(X2),a2)
    | ~ le(s(X1),X2) ),
    file('/export/starexec/sandbox2/tmp/tmp.LZZS1jPVzB/E---3.1_18613.p',sos_07) ).

cnf(sos_06,axiom,
    ( ~ eq(f(X1),a1)
    | ~ eq(f(X2),a1)
    | ~ le(s(X1),X2) ),
    file('/export/starexec/sandbox2/tmp/tmp.LZZS1jPVzB/E---3.1_18613.p',sos_06) ).

cnf(sos_04,axiom,
    ( eq(f(X1),a0)
    | eq(f(X1),a1)
    | eq(f(X1),a2) ),
    file('/export/starexec/sandbox2/tmp/tmp.LZZS1jPVzB/E---3.1_18613.p',sos_04) ).

cnf(sos_05,axiom,
    ( ~ eq(f(X1),a0)
    | ~ eq(f(X2),a0)
    | ~ le(s(X1),X2) ),
    file('/export/starexec/sandbox2/tmp/tmp.LZZS1jPVzB/E---3.1_18613.p',sos_05) ).

cnf(c_0_7,axiom,
    ( le(X1,X3)
    | ~ le(max(X1,X2),X3) ),
    sos_02 ).

cnf(c_0_8,axiom,
    le(X1,X1),
    sos_01 ).

cnf(c_0_9,axiom,
    ( le(X2,X3)
    | ~ le(max(X1,X2),X3) ),
    sos_03 ).

cnf(c_0_10,plain,
    le(X1,max(X1,X2)),
    inference(spm,[status(thm)],[c_0_7,c_0_8]) ).

cnf(c_0_11,axiom,
    ( ~ eq(f(X1),a2)
    | ~ eq(f(X2),a2)
    | ~ le(s(X1),X2) ),
    sos_07 ).

cnf(c_0_12,plain,
    le(X1,max(X2,X1)),
    inference(spm,[status(thm)],[c_0_9,c_0_8]) ).

cnf(c_0_13,axiom,
    ( ~ eq(f(X1),a1)
    | ~ eq(f(X2),a1)
    | ~ le(s(X1),X2) ),
    sos_06 ).

cnf(c_0_14,plain,
    le(X1,max(max(X2,X1),X3)),
    inference(spm,[status(thm)],[c_0_9,c_0_10]) ).

cnf(c_0_15,plain,
    ( ~ eq(f(max(X1,s(X2))),a2)
    | ~ eq(f(X2),a2) ),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_16,axiom,
    ( eq(f(X1),a0)
    | eq(f(X1),a1)
    | eq(f(X1),a2) ),
    sos_04 ).

cnf(c_0_17,axiom,
    ( ~ eq(f(X1),a0)
    | ~ eq(f(X2),a0)
    | ~ le(s(X1),X2) ),
    sos_05 ).

cnf(c_0_18,plain,
    le(X1,max(max(X1,X2),X3)),
    inference(spm,[status(thm)],[c_0_7,c_0_10]) ).

cnf(c_0_19,plain,
    ( ~ eq(f(max(max(X1,s(X2)),X3)),a1)
    | ~ eq(f(X2),a1) ),
    inference(spm,[status(thm)],[c_0_13,c_0_14]) ).

cnf(c_0_20,plain,
    ( eq(f(max(X1,s(X2))),a1)
    | eq(f(max(X1,s(X2))),a0)
    | ~ eq(f(X2),a2) ),
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

cnf(c_0_21,plain,
    le(X1,max(X2,max(X3,X1))),
    inference(spm,[status(thm)],[c_0_9,c_0_12]) ).

cnf(c_0_22,plain,
    ( ~ eq(f(max(max(s(X1),X2),X3)),a0)
    | ~ eq(f(X1),a0) ),
    inference(spm,[status(thm)],[c_0_17,c_0_18]) ).

cnf(c_0_23,plain,
    ( eq(f(max(max(X1,s(X2)),s(X3))),a0)
    | ~ eq(f(X2),a1)
    | ~ eq(f(X3),a2) ),
    inference(spm,[status(thm)],[c_0_19,c_0_20]) ).

cnf(c_0_24,plain,
    le(X1,max(X2,max(X3,max(X4,X1)))),
    inference(spm,[status(thm)],[c_0_9,c_0_21]) ).

cnf(c_0_25,plain,
    ( ~ eq(f(max(max(s(X1),X2),X3)),a1)
    | ~ eq(f(X1),a1) ),
    inference(spm,[status(thm)],[c_0_13,c_0_18]) ).

cnf(c_0_26,plain,
    ( ~ eq(f(X1),a0)
    | ~ eq(f(X2),a1)
    | ~ eq(f(X3),a2) ),
    inference(spm,[status(thm)],[c_0_22,c_0_23]) ).

cnf(c_0_27,plain,
    ( ~ eq(f(max(X1,max(X2,max(X3,s(X4))))),a2)
    | ~ eq(f(X4),a2) ),
    inference(spm,[status(thm)],[c_0_11,c_0_24]) ).

cnf(c_0_28,plain,
    ( ~ eq(f(X1),a1)
    | ~ eq(f(X2),a2) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_20]),c_0_26]) ).

cnf(c_0_29,plain,
    ( ~ eq(f(max(s(X1),X2)),a0)
    | ~ eq(f(X1),a0) ),
    inference(spm,[status(thm)],[c_0_17,c_0_10]) ).

cnf(c_0_30,plain,
    ( eq(f(max(X1,max(X2,max(X3,s(X4))))),a0)
    | ~ eq(f(X4),a2) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_16]),c_0_28]) ).

cnf(c_0_31,plain,
    ( ~ eq(f(X1),a0)
    | ~ eq(f(X2),a2) ),
    inference(spm,[status(thm)],[c_0_29,c_0_30]) ).

cnf(c_0_32,plain,
    ( ~ eq(f(X1),a2)
    | ~ eq(f(X2),a2) ),
    inference(spm,[status(thm)],[c_0_31,c_0_30]) ).

cnf(c_0_33,plain,
    ~ eq(f(X1),a2),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_16]),c_0_28]),c_0_31]) ).

cnf(c_0_34,plain,
    ( ~ eq(f(max(X1,s(X2))),a1)
    | ~ eq(f(X2),a1) ),
    inference(spm,[status(thm)],[c_0_13,c_0_12]) ).

cnf(c_0_35,plain,
    ( eq(f(X1),a1)
    | eq(f(X1),a0) ),
    inference(sr,[status(thm)],[c_0_16,c_0_33]) ).

cnf(c_0_36,plain,
    ( eq(f(max(X1,s(X2))),a0)
    | ~ eq(f(X2),a1) ),
    inference(spm,[status(thm)],[c_0_34,c_0_35]) ).

cnf(c_0_37,plain,
    le(X1,max(max(max(X1,X2),X3),X4)),
    inference(spm,[status(thm)],[c_0_7,c_0_18]) ).

cnf(c_0_38,plain,
    ( ~ eq(f(max(s(X1),X2)),a1)
    | ~ eq(f(X1),a1) ),
    inference(spm,[status(thm)],[c_0_13,c_0_10]) ).

cnf(c_0_39,plain,
    ( ~ eq(f(X1),a0)
    | ~ eq(f(X2),a1) ),
    inference(spm,[status(thm)],[c_0_29,c_0_36]) ).

cnf(c_0_40,plain,
    le(X1,max(max(max(max(X2,X1),X3),X4),X5)),
    inference(spm,[status(thm)],[c_0_9,c_0_37]) ).

cnf(c_0_41,plain,
    ~ eq(f(X1),a1),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_35]),c_0_39]) ).

cnf(c_0_42,plain,
    ( ~ eq(f(max(max(max(max(X1,s(X2)),X3),X4),X5)),a0)
    | ~ eq(f(X2),a0) ),
    inference(spm,[status(thm)],[c_0_17,c_0_40]) ).

cnf(c_0_43,plain,
    eq(f(X1),a0),
    inference(sr,[status(thm)],[c_0_35,c_0_41]) ).

cnf(c_0_44,plain,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_42,c_0_43]),c_0_43])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : SYO617-1 : TPTP v8.1.2. Released v7.1.0.
% 0.13/0.14  % Command    : run_E %s %d THM
% 0.14/0.35  % Computer : n004.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit   : 2400
% 0.14/0.35  % WCLimit    : 300
% 0.14/0.35  % DateTime   : Mon Oct  2 16:15:45 EDT 2023
% 0.14/0.35  % CPUTime    : 
% 0.20/0.48  Running first-order model finding
% 0.20/0.48  Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.LZZS1jPVzB/E---3.1_18613.p
% 0.20/0.51  # Version: 3.1pre001
% 0.20/0.51  # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.51  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.51  # Starting new_bool_3 with 300s (1) cores
% 0.20/0.51  # Starting new_bool_1 with 300s (1) cores
% 0.20/0.51  # Starting sh5l with 300s (1) cores
% 0.20/0.51  # new_bool_3 with pid 18728 completed with status 8
% 0.20/0.51  # new_bool_1 with pid 18729 completed with status 8
% 0.20/0.51  # sh5l with pid 18730 completed with status 8
% 0.20/0.51  # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 18727 completed with status 0
% 0.20/0.51  # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.20/0.51  # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.51  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.51  # No SInE strategy applied
% 0.20/0.51  # Search class: FGHNF-FFSF21-SFFFFFNN
% 0.20/0.51  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.51  # Starting G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_S032N with 811s (1) cores
% 0.20/0.51  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.20/0.51  # Starting new_bool_3 with 136s (1) cores
% 0.20/0.51  # Starting new_bool_1 with 136s (1) cores
% 0.20/0.51  # Starting sh5l with 136s (1) cores
% 0.20/0.51  # G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_S032N with pid 18732 completed with status 0
% 0.20/0.51  # Result found by G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_S032N
% 0.20/0.51  # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.51  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.51  # No SInE strategy applied
% 0.20/0.51  # Search class: FGHNF-FFSF21-SFFFFFNN
% 0.20/0.51  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.51  # Starting G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_S032N with 811s (1) cores
% 0.20/0.51  # Preprocessing time       : 0.001 s
% 0.20/0.51  # Presaturation interreduction done
% 0.20/0.51  
% 0.20/0.51  # Proof found!
% 0.20/0.51  # SZS status Unsatisfiable
% 0.20/0.51  # SZS output start CNFRefutation
% See solution above
% 0.20/0.51  # Parsed axioms                        : 7
% 0.20/0.51  # Removed by relevancy pruning/SinE    : 0
% 0.20/0.51  # Initial clauses                      : 7
% 0.20/0.51  # Removed in clause preprocessing      : 0
% 0.20/0.51  # Initial clauses in saturation        : 7
% 0.20/0.51  # Processed clauses                    : 217
% 0.20/0.51  # ...of these trivial                  : 0
% 0.20/0.51  # ...subsumed                          : 43
% 0.20/0.51  # ...remaining for further processing  : 174
% 0.20/0.51  # Other redundant clauses eliminated   : 0
% 0.20/0.51  # Clauses deleted for lack of memory   : 0
% 0.20/0.51  # Backward-subsumed                    : 95
% 0.20/0.51  # Backward-rewritten                   : 31
% 0.20/0.51  # Generated clauses                    : 437
% 0.20/0.51  # ...of the previous two non-redundant : 435
% 0.20/0.51  # ...aggressively subsumed             : 0
% 0.20/0.51  # Contextual simplify-reflections      : 6
% 0.20/0.51  # Paramodulations                      : 435
% 0.20/0.51  # Factorizations                       : 0
% 0.20/0.51  # NegExts                              : 0
% 0.20/0.51  # Equation resolutions                 : 0
% 0.20/0.51  # Total rewrite steps                  : 4
% 0.20/0.51  # Propositional unsat checks           : 0
% 0.20/0.51  #    Propositional check models        : 0
% 0.20/0.51  #    Propositional check unsatisfiable : 0
% 0.20/0.51  #    Propositional clauses             : 0
% 0.20/0.51  #    Propositional clauses after purity: 0
% 0.20/0.51  #    Propositional unsat core size     : 0
% 0.20/0.51  #    Propositional preprocessing time  : 0.000
% 0.20/0.51  #    Propositional encoding time       : 0.000
% 0.20/0.51  #    Propositional solver time         : 0.000
% 0.20/0.51  #    Success case prop preproc time    : 0.000
% 0.20/0.51  #    Success case prop encoding time   : 0.000
% 0.20/0.51  #    Success case prop solver time     : 0.000
% 0.20/0.51  # Current number of processed clauses  : 39
% 0.20/0.51  #    Positive orientable unit clauses  : 35
% 0.20/0.51  #    Positive unorientable unit clauses: 0
% 0.20/0.51  #    Negative unit clauses             : 2
% 0.20/0.51  #    Non-unit-clauses                  : 2
% 0.20/0.51  # Current number of unprocessed clauses: 187
% 0.20/0.51  # ...number of literals in the above   : 479
% 0.20/0.51  # Current number of archived formulas  : 0
% 0.20/0.51  # Current number of archived clauses   : 135
% 0.20/0.51  # Clause-clause subsumption calls (NU) : 2024
% 0.20/0.51  # Rec. Clause-clause subsumption calls : 1909
% 0.20/0.51  # Non-unit clause-clause subsumptions  : 99
% 0.20/0.51  # Unit Clause-clause subsumption calls : 111
% 0.20/0.51  # Rewrite failures with RHS unbound    : 0
% 0.20/0.51  # BW rewrite match attempts            : 263
% 0.20/0.51  # BW rewrite match successes           : 35
% 0.20/0.51  # Condensation attempts                : 0
% 0.20/0.51  # Condensation successes               : 0
% 0.20/0.51  # Termbank termtop insertions          : 8908
% 0.20/0.51  
% 0.20/0.51  # -------------------------------------------------
% 0.20/0.51  # User time                : 0.018 s
% 0.20/0.51  # System time              : 0.001 s
% 0.20/0.51  # Total time               : 0.019 s
% 0.20/0.51  # Maximum resident set size: 1604 pages
% 0.20/0.51  
% 0.20/0.51  # -------------------------------------------------
% 0.20/0.51  # User time                : 0.122 s
% 0.20/0.51  # System time              : 0.024 s
% 0.20/0.51  # Total time               : 0.146 s
% 0.20/0.51  # Maximum resident set size: 1676 pages
% 0.20/0.51  % E---3.1 exiting
%------------------------------------------------------------------------------