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

View Problem - Process Solution

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

% Computer : n024.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:33:15 EDT 2023

% Result   : Unsatisfiable 165.80s 21.58s
% Output   : CNFRefutation 165.80s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   11
% Syntax   : Number of clauses     :   32 (  12 unt;   0 nHn;  28 RR)
%            Number of literals    :   77 (   0 equ;  48 neg)
%            Maximal clause size   :    5 (   2 avg)
%            Maximal term depth    :    6 (   2 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :   17 (  17 usr;   7 con; 0-2 aty)
%            Number of variables   :   73 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(p20_26,negated_conjecture,
    ( p20(X1,X2)
    | ~ p9(X3,X1)
    | ~ p9(X4,X2)
    | ~ p20(X3,X4) ),
    file('/export/starexec/sandbox2/tmp/tmp.QEcJgSfSDN/E---3.1_4839.p',p20_26) ).

cnf(p20_34,negated_conjecture,
    p20(f16(f17(c28,c27)),f10(f15(f7(c23,f8(c24,c25)),c28),f11(f12(f13(f14(c29)))))),
    file('/export/starexec/sandbox2/tmp/tmp.QEcJgSfSDN/E---3.1_4839.p',p20_34) ).

cnf(p9_31,negated_conjecture,
    ( p9(f10(X1,X2),f10(X3,X4))
    | ~ p9(X1,X3)
    | ~ p9(X2,X4) ),
    file('/export/starexec/sandbox2/tmp/tmp.QEcJgSfSDN/E---3.1_4839.p',p9_31) ).

cnf(p9_20,negated_conjecture,
    ( p9(X1,X2)
    | ~ p9(X3,X1)
    | ~ p9(X3,X2) ),
    file('/export/starexec/sandbox2/tmp/tmp.QEcJgSfSDN/E---3.1_4839.p',p9_20) ).

cnf(p9_13,negated_conjecture,
    ( p9(f16(X1),f16(X2))
    | ~ p9(X1,X2) ),
    file('/export/starexec/sandbox2/tmp/tmp.QEcJgSfSDN/E---3.1_4839.p',p9_13) ).

cnf(p9_30,negated_conjecture,
    ( p9(f15(X1,X2),f15(X3,X4))
    | ~ p2(X1,X3)
    | ~ p9(X2,X4) ),
    file('/export/starexec/sandbox2/tmp/tmp.QEcJgSfSDN/E---3.1_4839.p',p9_30) ).

cnf(p9_2,negated_conjecture,
    p9(X1,X1),
    file('/export/starexec/sandbox2/tmp/tmp.QEcJgSfSDN/E---3.1_4839.p',p9_2) ).

cnf(p9_29,negated_conjecture,
    ( p9(f17(X1,X2),f17(X3,X4))
    | ~ p9(X1,X3)
    | ~ p9(X2,X4) ),
    file('/export/starexec/sandbox2/tmp/tmp.QEcJgSfSDN/E---3.1_4839.p',p9_29) ).

cnf(not_p20_35,negated_conjecture,
    ~ p20(f16(f17(c22,c27)),f10(f15(f7(c23,f8(c24,c25)),c22),f11(f12(f13(f14(c29)))))),
    file('/export/starexec/sandbox2/tmp/tmp.QEcJgSfSDN/E---3.1_4839.p',not_p20_35) ).

cnf(p9_6,negated_conjecture,
    p9(c28,c22),
    file('/export/starexec/sandbox2/tmp/tmp.QEcJgSfSDN/E---3.1_4839.p',p9_6) ).

cnf(p2_1,negated_conjecture,
    p2(X1,X1),
    file('/export/starexec/sandbox2/tmp/tmp.QEcJgSfSDN/E---3.1_4839.p',p2_1) ).

cnf(c_0_11,negated_conjecture,
    ( p20(X1,X2)
    | ~ p9(X3,X1)
    | ~ p9(X4,X2)
    | ~ p20(X3,X4) ),
    p20_26 ).

cnf(c_0_12,negated_conjecture,
    p20(f16(f17(c28,c27)),f10(f15(f7(c23,f8(c24,c25)),c28),f11(f12(f13(f14(c29)))))),
    p20_34 ).

cnf(c_0_13,negated_conjecture,
    ( p20(X1,X2)
    | ~ p9(f10(f15(f7(c23,f8(c24,c25)),c28),f11(f12(f13(f14(c29))))),X2)
    | ~ p9(f16(f17(c28,c27)),X1) ),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_14,negated_conjecture,
    ( p9(f10(X1,X2),f10(X3,X4))
    | ~ p9(X1,X3)
    | ~ p9(X2,X4) ),
    p9_31 ).

cnf(c_0_15,negated_conjecture,
    ( p9(X1,X2)
    | ~ p9(X3,X1)
    | ~ p9(X3,X2) ),
    p9_20 ).

cnf(c_0_16,negated_conjecture,
    ( p9(f16(X1),f16(X2))
    | ~ p9(X1,X2) ),
    p9_13 ).

cnf(c_0_17,negated_conjecture,
    ( p20(X1,f10(X2,X3))
    | ~ p9(f15(f7(c23,f8(c24,c25)),c28),X2)
    | ~ p9(f11(f12(f13(f14(c29)))),X3)
    | ~ p9(f16(f17(c28,c27)),X1) ),
    inference(spm,[status(thm)],[c_0_13,c_0_14]) ).

cnf(c_0_18,negated_conjecture,
    ( p9(f15(X1,X2),f15(X3,X4))
    | ~ p2(X1,X3)
    | ~ p9(X2,X4) ),
    p9_30 ).

cnf(c_0_19,negated_conjecture,
    ( p9(X1,f16(X2))
    | ~ p9(f16(X3),X1)
    | ~ p9(X3,X2) ),
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

cnf(c_0_20,negated_conjecture,
    ( p20(X1,f10(f15(X2,X3),X4))
    | ~ p9(f11(f12(f13(f14(c29)))),X4)
    | ~ p9(f16(f17(c28,c27)),X1)
    | ~ p9(c28,X3)
    | ~ p2(f7(c23,f8(c24,c25)),X2) ),
    inference(spm,[status(thm)],[c_0_17,c_0_18]) ).

cnf(c_0_21,negated_conjecture,
    p9(X1,X1),
    p9_2 ).

cnf(c_0_22,negated_conjecture,
    ( p9(f16(X1),f16(X2))
    | ~ p9(X3,X2)
    | ~ p9(X3,X1) ),
    inference(spm,[status(thm)],[c_0_19,c_0_16]) ).

cnf(c_0_23,negated_conjecture,
    ( p9(f17(X1,X2),f17(X3,X4))
    | ~ p9(X1,X3)
    | ~ p9(X2,X4) ),
    p9_29 ).

cnf(c_0_24,negated_conjecture,
    ~ p20(f16(f17(c22,c27)),f10(f15(f7(c23,f8(c24,c25)),c22),f11(f12(f13(f14(c29)))))),
    not_p20_35 ).

cnf(c_0_25,negated_conjecture,
    ( p20(X1,f10(f15(X2,X3),f11(f12(f13(f14(c29))))))
    | ~ p9(f16(f17(c28,c27)),X1)
    | ~ p9(c28,X3)
    | ~ p2(f7(c23,f8(c24,c25)),X2) ),
    inference(spm,[status(thm)],[c_0_20,c_0_21]) ).

cnf(c_0_26,negated_conjecture,
    p9(c28,c22),
    p9_6 ).

cnf(c_0_27,negated_conjecture,
    p2(X1,X1),
    p2_1 ).

cnf(c_0_28,negated_conjecture,
    ( p9(f16(X1),f16(f17(X2,X3)))
    | ~ p9(f17(X4,X5),X1)
    | ~ p9(X5,X3)
    | ~ p9(X4,X2) ),
    inference(spm,[status(thm)],[c_0_22,c_0_23]) ).

cnf(c_0_29,negated_conjecture,
    ~ p9(f16(f17(c28,c27)),f16(f17(c22,c27))),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]),c_0_27])]) ).

cnf(c_0_30,negated_conjecture,
    ( p9(f16(f17(X1,X2)),f16(f17(X3,X4)))
    | ~ p9(X2,X4)
    | ~ p9(X1,X3) ),
    inference(spm,[status(thm)],[c_0_28,c_0_21]) ).

cnf(c_0_31,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_21]),c_0_26])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem    : SYN628-1 : TPTP v8.1.2. Released v2.5.0.
% 0.11/0.13  % Command    : run_E %s %d THM
% 0.14/0.34  % Computer : n024.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit   : 2400
% 0.14/0.34  % WCLimit    : 300
% 0.14/0.34  % DateTime   : Mon Oct  2 18:30:57 EDT 2023
% 0.14/0.34  % CPUTime    : 
% 0.20/0.47  Running first-order model finding
% 0.20/0.47  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.QEcJgSfSDN/E---3.1_4839.p
% 165.80/21.58  # Version: 3.1pre001
% 165.80/21.58  # Preprocessing class: FSMSSMSMSSSNFFN.
% 165.80/21.58  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 165.80/21.58  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 165.80/21.58  # Starting new_bool_3 with 300s (1) cores
% 165.80/21.58  # Starting new_bool_1 with 300s (1) cores
% 165.80/21.58  # Starting sh5l with 300s (1) cores
% 165.80/21.58  # new_bool_1 with pid 4920 completed with status 0
% 165.80/21.58  # Result found by new_bool_1
% 165.80/21.58  # Preprocessing class: FSMSSMSMSSSNFFN.
% 165.80/21.58  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 165.80/21.58  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 165.80/21.58  # Starting new_bool_3 with 300s (1) cores
% 165.80/21.58  # Starting new_bool_1 with 300s (1) cores
% 165.80/21.58  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 165.80/21.58  # Search class: FHHNM-FFMM21-MFFFFFNN
% 165.80/21.58  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 165.80/21.58  # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 165.80/21.58  # G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 4926 completed with status 0
% 165.80/21.58  # Result found by G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 165.80/21.58  # Preprocessing class: FSMSSMSMSSSNFFN.
% 165.80/21.58  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 165.80/21.58  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 165.80/21.58  # Starting new_bool_3 with 300s (1) cores
% 165.80/21.58  # Starting new_bool_1 with 300s (1) cores
% 165.80/21.58  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 165.80/21.58  # Search class: FHHNM-FFMM21-MFFFFFNN
% 165.80/21.58  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 165.80/21.58  # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 165.80/21.58  # Preprocessing time       : 0.001 s
% 165.80/21.58  # Presaturation interreduction done
% 165.80/21.58  
% 165.80/21.58  # Proof found!
% 165.80/21.58  # SZS status Unsatisfiable
% 165.80/21.58  # SZS output start CNFRefutation
% See solution above
% 165.80/21.58  # Parsed axioms                        : 36
% 165.80/21.58  # Removed by relevancy pruning/SinE    : 0
% 165.80/21.58  # Initial clauses                      : 36
% 165.80/21.58  # Removed in clause preprocessing      : 0
% 165.80/21.58  # Initial clauses in saturation        : 36
% 165.80/21.58  # Processed clauses                    : 106213
% 165.80/21.58  # ...of these trivial                  : 65
% 165.80/21.58  # ...subsumed                          : 97695
% 165.80/21.58  # ...remaining for further processing  : 8453
% 165.80/21.58  # Other redundant clauses eliminated   : 0
% 165.80/21.58  # Clauses deleted for lack of memory   : 0
% 165.80/21.58  # Backward-subsumed                    : 188
% 165.80/21.58  # Backward-rewritten                   : 7
% 165.80/21.58  # Generated clauses                    : 2121141
% 165.80/21.58  # ...of the previous two non-redundant : 2050154
% 165.80/21.58  # ...aggressively subsumed             : 0
% 165.80/21.58  # Contextual simplify-reflections      : 35
% 165.80/21.58  # Paramodulations                      : 2121141
% 165.80/21.58  # Factorizations                       : 0
% 165.80/21.58  # NegExts                              : 0
% 165.80/21.58  # Equation resolutions                 : 0
% 165.80/21.58  # Total rewrite steps                  : 409288
% 165.80/21.58  # Propositional unsat checks           : 1
% 165.80/21.58  #    Propositional check models        : 1
% 165.80/21.58  #    Propositional check unsatisfiable : 0
% 165.80/21.58  #    Propositional clauses             : 0
% 165.80/21.58  #    Propositional clauses after purity: 0
% 165.80/21.58  #    Propositional unsat core size     : 0
% 165.80/21.58  #    Propositional preprocessing time  : 0.000
% 165.80/21.58  #    Propositional encoding time       : 0.460
% 165.80/21.58  #    Propositional solver time         : 0.188
% 165.80/21.58  #    Success case prop preproc time    : 0.000
% 165.80/21.58  #    Success case prop encoding time   : 0.000
% 165.80/21.58  #    Success case prop solver time     : 0.000
% 165.80/21.58  # Current number of processed clauses  : 8222
% 165.80/21.58  #    Positive orientable unit clauses  : 57
% 165.80/21.58  #    Positive unorientable unit clauses: 0
% 165.80/21.58  #    Negative unit clauses             : 2
% 165.80/21.58  #    Non-unit-clauses                  : 8163
% 165.80/21.58  # Current number of unprocessed clauses: 1940024
% 165.80/21.58  # ...number of literals in the above   : 9255359
% 165.80/21.58  # Current number of archived formulas  : 0
% 165.80/21.58  # Current number of archived clauses   : 231
% 165.80/21.58  # Clause-clause subsumption calls (NU) : 24488624
% 165.80/21.58  # Rec. Clause-clause subsumption calls : 12215184
% 165.80/21.58  # Non-unit clause-clause subsumptions  : 97918
% 165.80/21.58  # Unit Clause-clause subsumption calls : 6177
% 165.80/21.58  # Rewrite failures with RHS unbound    : 0
% 165.80/21.58  # BW rewrite match attempts            : 158
% 165.80/21.58  # BW rewrite match successes           : 7
% 165.80/21.58  # Condensation attempts                : 0
% 165.80/21.58  # Condensation successes               : 0
% 165.80/21.58  # Termbank termtop insertions          : 41602974
% 165.80/21.58  
% 165.80/21.58  # -------------------------------------------------
% 165.80/21.58  # User time                : 19.897 s
% 165.80/21.58  # System time              : 0.752 s
% 165.80/21.58  # Total time               : 20.649 s
% 165.80/21.58  # Maximum resident set size: 1792 pages
% 165.80/21.58  
% 165.80/21.58  # -------------------------------------------------
% 165.80/21.58  # User time                : 19.899 s
% 165.80/21.58  # System time              : 0.754 s
% 165.80/21.58  # Total time               : 20.653 s
% 165.80/21.58  # Maximum resident set size: 1712 pages
% 165.80/21.58  % E---3.1 exiting
%------------------------------------------------------------------------------