TSTP Solution File: SYN578-1 by E---3.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1
% Problem  : SYN578-1 : TPTP v8.1.2. Released v2.5.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n005.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:17:51 EDT 2023

% Result   : Unsatisfiable 0.15s 0.47s
% Output   : CNFRefutation 0.15s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :   14
% Syntax   : Number of clauses     :   48 (  20 unt;   4 nHn;  40 RR)
%            Number of literals    :   98 (   0 equ;  50 neg)
%            Maximal clause size   :    4 (   2 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    6 (   5 usr;   1 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   5 con; 0-2 aty)
%            Number of variables   :   64 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(p3_17,negated_conjecture,
    ( p3(X1,X2)
    | ~ p3(X3,X1)
    | ~ p3(X3,X2) ),
    file('/export/starexec/sandbox/tmp/tmp.Uc5ZBHyO4T/E---3.1_29725.p',p3_17) ).

cnf(p3_14,negated_conjecture,
    ( p3(f4(X1),f4(X2))
    | ~ p2(X1,X2) ),
    file('/export/starexec/sandbox/tmp/tmp.Uc5ZBHyO4T/E---3.1_29725.p',p3_14) ).

cnf(p2_18,negated_conjecture,
    ( p2(X1,X2)
    | ~ p2(X3,X1)
    | ~ p2(X3,X2) ),
    file('/export/starexec/sandbox/tmp/tmp.Uc5ZBHyO4T/E---3.1_29725.p',p2_18) ).

cnf(p2_4,negated_conjecture,
    p2(X1,X1),
    file('/export/starexec/sandbox/tmp/tmp.Uc5ZBHyO4T/E---3.1_29725.p',p2_4) ).

cnf(p2_7,negated_conjecture,
    p2(c16,f5(c14)),
    file('/export/starexec/sandbox/tmp/tmp.Uc5ZBHyO4T/E---3.1_29725.p',p2_7) ).

cnf(p3_8,negated_conjecture,
    p3(f4(f5(X1)),f4(X1)),
    file('/export/starexec/sandbox/tmp/tmp.Uc5ZBHyO4T/E---3.1_29725.p',p3_8) ).

cnf(p3_3,negated_conjecture,
    p3(X1,X1),
    file('/export/starexec/sandbox/tmp/tmp.Uc5ZBHyO4T/E---3.1_29725.p',p3_3) ).

cnf(p9_20,negated_conjecture,
    ( p9(X1,X2)
    | ~ p7(X3,X1)
    | ~ p9(X3,X4)
    | ~ p3(X4,X2) ),
    file('/export/starexec/sandbox/tmp/tmp.Uc5ZBHyO4T/E---3.1_29725.p',p9_20) ).

cnf(p9_22,negated_conjecture,
    ( p9(f8(X1,X2),X1)
    | p9(f8(X1,X2),f4(X2))
    | ~ p11(X2,c15)
    | ~ p9(c12,X1) ),
    file('/export/starexec/sandbox/tmp/tmp.Uc5ZBHyO4T/E---3.1_29725.p',p9_22) ).

cnf(p11_6,negated_conjecture,
    p11(c14,c15),
    file('/export/starexec/sandbox/tmp/tmp.Uc5ZBHyO4T/E---3.1_29725.p',p11_6) ).

cnf(p7_2,negated_conjecture,
    p7(X1,X1),
    file('/export/starexec/sandbox/tmp/tmp.Uc5ZBHyO4T/E---3.1_29725.p',p7_2) ).

cnf(p9_11,negated_conjecture,
    ( p9(X1,f4(c16))
    | ~ p9(X1,c13) ),
    file('/export/starexec/sandbox/tmp/tmp.Uc5ZBHyO4T/E---3.1_29725.p',p9_11) ).

cnf(p9_5,negated_conjecture,
    p9(c12,c13),
    file('/export/starexec/sandbox/tmp/tmp.Uc5ZBHyO4T/E---3.1_29725.p',p9_5) ).

cnf(not_p11_23,negated_conjecture,
    ( ~ p11(X1,c15)
    | ~ p9(c12,X2)
    | ~ p9(f8(X2,X1),X2)
    | ~ p9(f8(X2,X1),f4(X1)) ),
    file('/export/starexec/sandbox/tmp/tmp.Uc5ZBHyO4T/E---3.1_29725.p',not_p11_23) ).

cnf(c_0_14,negated_conjecture,
    ( p3(X1,X2)
    | ~ p3(X3,X1)
    | ~ p3(X3,X2) ),
    p3_17 ).

cnf(c_0_15,negated_conjecture,
    ( p3(f4(X1),f4(X2))
    | ~ p2(X1,X2) ),
    p3_14 ).

cnf(c_0_16,negated_conjecture,
    ( p2(X1,X2)
    | ~ p2(X3,X1)
    | ~ p2(X3,X2) ),
    p2_18 ).

cnf(c_0_17,negated_conjecture,
    p2(X1,X1),
    p2_4 ).

cnf(c_0_18,negated_conjecture,
    ( p3(X1,f4(X2))
    | ~ p2(X3,X2)
    | ~ p3(f4(X3),X1) ),
    inference(spm,[status(thm)],[c_0_14,c_0_15]) ).

cnf(c_0_19,negated_conjecture,
    ( p2(X1,X2)
    | ~ p2(X2,X1) ),
    inference(spm,[status(thm)],[c_0_16,c_0_17]) ).

cnf(c_0_20,negated_conjecture,
    p2(c16,f5(c14)),
    p2_7 ).

cnf(c_0_21,negated_conjecture,
    p3(f4(f5(X1)),f4(X1)),
    p3_8 ).

cnf(c_0_22,negated_conjecture,
    ( p3(f4(X1),f4(X2))
    | ~ p2(X3,X2)
    | ~ p2(X3,X1) ),
    inference(spm,[status(thm)],[c_0_18,c_0_15]) ).

cnf(c_0_23,negated_conjecture,
    p2(f5(c14),c16),
    inference(spm,[status(thm)],[c_0_19,c_0_20]) ).

cnf(c_0_24,negated_conjecture,
    ( p3(X1,f4(X2))
    | ~ p3(f4(f5(X2)),X1) ),
    inference(spm,[status(thm)],[c_0_14,c_0_21]) ).

cnf(c_0_25,negated_conjecture,
    ( p3(f4(X1),f4(c16))
    | ~ p2(f5(c14),X1) ),
    inference(spm,[status(thm)],[c_0_22,c_0_23]) ).

cnf(c_0_26,negated_conjecture,
    p3(X1,X1),
    p3_3 ).

cnf(c_0_27,negated_conjecture,
    ( p3(f4(c16),f4(X1))
    | ~ p2(f5(c14),f5(X1)) ),
    inference(spm,[status(thm)],[c_0_24,c_0_25]) ).

cnf(c_0_28,negated_conjecture,
    ( p3(X1,X2)
    | ~ p3(X2,X1) ),
    inference(spm,[status(thm)],[c_0_14,c_0_26]) ).

cnf(c_0_29,negated_conjecture,
    p3(f4(c16),f4(c14)),
    inference(spm,[status(thm)],[c_0_27,c_0_17]) ).

cnf(c_0_30,negated_conjecture,
    ( p9(X1,X2)
    | ~ p7(X3,X1)
    | ~ p9(X3,X4)
    | ~ p3(X4,X2) ),
    p9_20 ).

cnf(c_0_31,negated_conjecture,
    p3(f4(c14),f4(c16)),
    inference(spm,[status(thm)],[c_0_28,c_0_29]) ).

cnf(c_0_32,negated_conjecture,
    ( p9(f8(X1,X2),X1)
    | p9(f8(X1,X2),f4(X2))
    | ~ p11(X2,c15)
    | ~ p9(c12,X1) ),
    p9_22 ).

cnf(c_0_33,negated_conjecture,
    p11(c14,c15),
    p11_6 ).

cnf(c_0_34,negated_conjecture,
    ( p9(X1,f4(c14))
    | ~ p9(X2,f4(c16))
    | ~ p7(X2,X1) ),
    inference(spm,[status(thm)],[c_0_30,c_0_29]) ).

cnf(c_0_35,negated_conjecture,
    p7(X1,X1),
    p7_2 ).

cnf(c_0_36,negated_conjecture,
    ( p9(X1,f4(c16))
    | ~ p9(X2,f4(c14))
    | ~ p7(X2,X1) ),
    inference(spm,[status(thm)],[c_0_30,c_0_31]) ).

cnf(c_0_37,negated_conjecture,
    ( p9(f8(X1,c14),f4(c14))
    | p9(f8(X1,c14),X1)
    | ~ p9(c12,X1) ),
    inference(spm,[status(thm)],[c_0_32,c_0_33]) ).

cnf(c_0_38,negated_conjecture,
    ( p9(X1,f4(c16))
    | ~ p9(X1,c13) ),
    p9_11 ).

cnf(c_0_39,negated_conjecture,
    p9(c12,c13),
    p9_5 ).

cnf(c_0_40,negated_conjecture,
    ( ~ p11(X1,c15)
    | ~ p9(c12,X2)
    | ~ p9(f8(X2,X1),X2)
    | ~ p9(f8(X2,X1),f4(X1)) ),
    not_p11_23 ).

cnf(c_0_41,negated_conjecture,
    ( p9(X1,f4(c14))
    | ~ p9(X1,f4(c16)) ),
    inference(spm,[status(thm)],[c_0_34,c_0_35]) ).

cnf(c_0_42,negated_conjecture,
    ( p9(X1,f4(c16))
    | ~ p9(X1,f4(c14)) ),
    inference(spm,[status(thm)],[c_0_36,c_0_35]) ).

cnf(c_0_43,negated_conjecture,
    ( p9(f8(f4(c16),c14),f4(c16))
    | p9(f8(f4(c16),c14),f4(c14)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39])]) ).

cnf(c_0_44,negated_conjecture,
    ( ~ p9(f8(X1,c14),f4(c16))
    | ~ p9(f8(X1,c14),X1)
    | ~ p9(c12,X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_33])]) ).

cnf(c_0_45,negated_conjecture,
    p9(f8(f4(c16),c14),f4(c16)),
    inference(spm,[status(thm)],[c_0_42,c_0_43]) ).

cnf(c_0_46,negated_conjecture,
    ~ p9(c12,f4(c16)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_45])]) ).

cnf(c_0_47,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_38]),c_0_39])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem    : SYN578-1 : TPTP v8.1.2. Released v2.5.0.
% 0.03/0.12  % Command    : run_E %s %d THM
% 0.11/0.32  % Computer : n005.cluster.edu
% 0.11/0.32  % Model    : x86_64 x86_64
% 0.11/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32  % Memory   : 8042.1875MB
% 0.11/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.32  % CPULimit   : 2400
% 0.15/0.32  % WCLimit    : 300
% 0.15/0.32  % DateTime   : Mon Oct  2 18:29:31 EDT 2023
% 0.15/0.32  % CPUTime    : 
% 0.15/0.44  Running first-order theorem proving
% 0.15/0.44  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.Uc5ZBHyO4T/E---3.1_29725.p
% 0.15/0.47  # Version: 3.1pre001
% 0.15/0.47  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.47  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.47  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.47  # Starting new_bool_3 with 300s (1) cores
% 0.15/0.47  # Starting new_bool_1 with 300s (1) cores
% 0.15/0.47  # Starting sh5l with 300s (1) cores
% 0.15/0.47  # new_bool_3 with pid 29804 completed with status 0
% 0.15/0.47  # Result found by new_bool_3
% 0.15/0.47  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.47  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.47  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.47  # Starting new_bool_3 with 300s (1) cores
% 0.15/0.47  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.47  # Search class: FGHNM-FFSS21-SFFFFFNN
% 0.15/0.47  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.47  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.15/0.47  # SAT001_MinMin_p005000_rr_RG with pid 29809 completed with status 0
% 0.15/0.47  # Result found by SAT001_MinMin_p005000_rr_RG
% 0.15/0.47  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.47  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.47  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.47  # Starting new_bool_3 with 300s (1) cores
% 0.15/0.47  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.47  # Search class: FGHNM-FFSS21-SFFFFFNN
% 0.15/0.47  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.47  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.15/0.47  # Preprocessing time       : 0.001 s
% 0.15/0.47  # Presaturation interreduction done
% 0.15/0.47  
% 0.15/0.47  # Proof found!
% 0.15/0.47  # SZS status Unsatisfiable
% 0.15/0.47  # SZS output start CNFRefutation
% See solution above
% 0.15/0.47  # Parsed axioms                        : 23
% 0.15/0.47  # Removed by relevancy pruning/SinE    : 0
% 0.15/0.47  # Initial clauses                      : 23
% 0.15/0.47  # Removed in clause preprocessing      : 0
% 0.15/0.47  # Initial clauses in saturation        : 23
% 0.15/0.47  # Processed clauses                    : 415
% 0.15/0.47  # ...of these trivial                  : 3
% 0.15/0.47  # ...subsumed                          : 155
% 0.15/0.47  # ...remaining for further processing  : 257
% 0.15/0.47  # Other redundant clauses eliminated   : 0
% 0.15/0.47  # Clauses deleted for lack of memory   : 0
% 0.15/0.47  # Backward-subsumed                    : 11
% 0.15/0.47  # Backward-rewritten                   : 3
% 0.15/0.47  # Generated clauses                    : 1670
% 0.15/0.47  # ...of the previous two non-redundant : 1378
% 0.15/0.47  # ...aggressively subsumed             : 0
% 0.15/0.47  # Contextual simplify-reflections      : 1
% 0.15/0.47  # Paramodulations                      : 1670
% 0.15/0.47  # Factorizations                       : 0
% 0.15/0.47  # NegExts                              : 0
% 0.15/0.47  # Equation resolutions                 : 0
% 0.15/0.47  # Total rewrite steps                  : 416
% 0.15/0.47  # Propositional unsat checks           : 0
% 0.15/0.47  #    Propositional check models        : 0
% 0.15/0.47  #    Propositional check unsatisfiable : 0
% 0.15/0.47  #    Propositional clauses             : 0
% 0.15/0.47  #    Propositional clauses after purity: 0
% 0.15/0.47  #    Propositional unsat core size     : 0
% 0.15/0.47  #    Propositional preprocessing time  : 0.000
% 0.15/0.47  #    Propositional encoding time       : 0.000
% 0.15/0.47  #    Propositional solver time         : 0.000
% 0.15/0.47  #    Success case prop preproc time    : 0.000
% 0.15/0.47  #    Success case prop encoding time   : 0.000
% 0.15/0.47  #    Success case prop solver time     : 0.000
% 0.15/0.47  # Current number of processed clauses  : 220
% 0.15/0.47  #    Positive orientable unit clauses  : 44
% 0.15/0.47  #    Positive unorientable unit clauses: 0
% 0.15/0.47  #    Negative unit clauses             : 1
% 0.15/0.47  #    Non-unit-clauses                  : 175
% 0.15/0.47  # Current number of unprocessed clauses: 1008
% 0.15/0.47  # ...number of literals in the above   : 2800
% 0.15/0.47  # Current number of archived formulas  : 0
% 0.15/0.47  # Current number of archived clauses   : 37
% 0.15/0.47  # Clause-clause subsumption calls (NU) : 6191
% 0.15/0.47  # Rec. Clause-clause subsumption calls : 5284
% 0.15/0.47  # Non-unit clause-clause subsumptions  : 164
% 0.15/0.47  # Unit Clause-clause subsumption calls : 111
% 0.15/0.47  # Rewrite failures with RHS unbound    : 0
% 0.15/0.47  # BW rewrite match attempts            : 50
% 0.15/0.47  # BW rewrite match successes           : 6
% 0.15/0.47  # Condensation attempts                : 0
% 0.15/0.47  # Condensation successes               : 0
% 0.15/0.47  # Termbank termtop insertions          : 20899
% 0.15/0.47  
% 0.15/0.47  # -------------------------------------------------
% 0.15/0.47  # User time                : 0.028 s
% 0.15/0.47  # System time              : 0.001 s
% 0.15/0.47  # Total time               : 0.029 s
% 0.15/0.47  # Maximum resident set size: 1632 pages
% 0.15/0.47  
% 0.15/0.47  # -------------------------------------------------
% 0.15/0.47  # User time                : 0.030 s
% 0.15/0.47  # System time              : 0.002 s
% 0.15/0.47  # Total time               : 0.031 s
% 0.15/0.47  # Maximum resident set size: 1692 pages
% 0.15/0.47  % E---3.1 exiting
% 0.15/0.47  % E---3.1 exiting
%------------------------------------------------------------------------------