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

View Problem - Process Solution

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

% Computer : n016.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:16 EDT 2023

% Result   : Unsatisfiable 0.20s 0.52s
% Output   : CNFRefutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    8
% Syntax   : Number of clauses     :   21 (  14 unt;   0 nHn;  15 RR)
%            Number of literals    :   40 (   0 equ;  21 neg)
%            Maximal clause size   :    5 (   1 avg)
%            Maximal term depth    :    9 (   3 avg)
%            Number of predicates  :    5 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :   21 (  21 usr;   8 con; 0-2 aty)
%            Number of variables   :   30 (   6 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(p22_19,negated_conjecture,
    ( p22(X1,X2)
    | ~ p4(X3,X1)
    | ~ p4(X4,X2)
    | ~ p22(X3,X4) ),
    file('/export/starexec/sandbox2/tmp/tmp.1eFb2nl9BW/E---3.1_14915.p',p22_19) ).

cnf(p22_17,negated_conjecture,
    p22(f12(f9(f10(f11(c29))),f18(c24,f9(f11(c29)))),c27),
    file('/export/starexec/sandbox2/tmp/tmp.1eFb2nl9BW/E---3.1_14915.p',p22_17) ).

cnf(p4_34,negated_conjecture,
    ( p4(f5(f7(X1,f8(X2,X3)),X4),X5)
    | ~ p21(X6,f9(f10(f11(c29))))
    | ~ p21(X5,f12(f9(f10(f11(c29))),X2))
    | ~ p22(f12(f9(f10(f11(c29))),f18(X2,f9(f11(c29)))),X5)
    | ~ p3(X4,f13(f15(f17(f16(f9(f11(c29)))),X6),f13(f15(f16(f9(f10(f11(c29)))),X7),f14(f16(X5),f15(f16(f9(f10(f11(c29)))),X3))))) ),
    file('/export/starexec/sandbox2/tmp/tmp.1eFb2nl9BW/E---3.1_14915.p',p4_34) ).

cnf(p3_30,negated_conjecture,
    p3(c26,f13(f15(f17(f16(f9(f11(c29)))),c28),f13(f15(f16(f9(f10(f11(c29)))),c30),f14(f16(c27),f15(f16(f9(f10(f11(c29)))),c25))))),
    file('/export/starexec/sandbox2/tmp/tmp.1eFb2nl9BW/E---3.1_14915.p',p3_30) ).

cnf(p21_5,negated_conjecture,
    p21(c28,f9(f10(f11(c29)))),
    file('/export/starexec/sandbox2/tmp/tmp.1eFb2nl9BW/E---3.1_14915.p',p21_5) ).

cnf(p4_3,negated_conjecture,
    p4(X1,X1),
    file('/export/starexec/sandbox2/tmp/tmp.1eFb2nl9BW/E---3.1_14915.p',p4_3) ).

cnf(p21_6,negated_conjecture,
    p21(c27,f12(f9(f10(f11(c29))),c24)),
    file('/export/starexec/sandbox2/tmp/tmp.1eFb2nl9BW/E---3.1_14915.p',p21_6) ).

cnf(not_p4_12,negated_conjecture,
    ~ p4(f5(f7(c23,f8(c24,c25)),c26),c27),
    file('/export/starexec/sandbox2/tmp/tmp.1eFb2nl9BW/E---3.1_14915.p',not_p4_12) ).

cnf(c_0_8,negated_conjecture,
    ( p22(X1,X2)
    | ~ p4(X3,X1)
    | ~ p4(X4,X2)
    | ~ p22(X3,X4) ),
    p22_19 ).

cnf(c_0_9,negated_conjecture,
    p22(f12(f9(f10(f11(c29))),f18(c24,f9(f11(c29)))),c27),
    p22_17 ).

cnf(c_0_10,negated_conjecture,
    ( p4(f5(f7(X1,f8(X2,X3)),X4),X5)
    | ~ p21(X6,f9(f10(f11(c29))))
    | ~ p21(X5,f12(f9(f10(f11(c29))),X2))
    | ~ p22(f12(f9(f10(f11(c29))),f18(X2,f9(f11(c29)))),X5)
    | ~ p3(X4,f13(f15(f17(f16(f9(f11(c29)))),X6),f13(f15(f16(f9(f10(f11(c29)))),X7),f14(f16(X5),f15(f16(f9(f10(f11(c29)))),X3))))) ),
    p4_34 ).

cnf(c_0_11,negated_conjecture,
    p3(c26,f13(f15(f17(f16(f9(f11(c29)))),c28),f13(f15(f16(f9(f10(f11(c29)))),c30),f14(f16(c27),f15(f16(f9(f10(f11(c29)))),c25))))),
    p3_30 ).

cnf(c_0_12,negated_conjecture,
    p21(c28,f9(f10(f11(c29)))),
    p21_5 ).

cnf(c_0_13,negated_conjecture,
    ( p22(X1,X2)
    | ~ p4(f12(f9(f10(f11(c29))),f18(c24,f9(f11(c29)))),X1)
    | ~ p4(c27,X2) ),
    inference(spm,[status(thm)],[c_0_8,c_0_9]) ).

cnf(c_0_14,negated_conjecture,
    p4(X1,X1),
    p4_3 ).

cnf(c_0_15,negated_conjecture,
    ( p4(f5(f7(X1,f8(X2,c25)),c26),c27)
    | ~ p22(f12(f9(f10(f11(c29))),f18(X2,f9(f11(c29)))),c27)
    | ~ p21(c27,f12(f9(f10(f11(c29))),X2)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12])]) ).

cnf(c_0_16,negated_conjecture,
    ( p22(f12(f9(f10(f11(c29))),f18(c24,f9(f11(c29)))),X1)
    | ~ p4(c27,X1) ),
    inference(spm,[status(thm)],[c_0_13,c_0_14]) ).

cnf(c_0_17,negated_conjecture,
    p21(c27,f12(f9(f10(f11(c29))),c24)),
    p21_6 ).

cnf(c_0_18,negated_conjecture,
    ~ p4(f5(f7(c23,f8(c24,c25)),c26),c27),
    not_p4_12 ).

cnf(c_0_19,negated_conjecture,
    p4(f5(f7(X1,f8(c24,c25)),c26),c27),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]),c_0_14])]) ).

cnf(c_0_20,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_19])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11  % Problem    : SYN630-1 : TPTP v8.1.2. Released v2.5.0.
% 0.07/0.13  % Command    : run_E %s %d THM
% 0.13/0.33  % Computer : n016.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit   : 2400
% 0.13/0.34  % WCLimit    : 300
% 0.13/0.34  % DateTime   : Mon Oct  2 19:13:06 EDT 2023
% 0.13/0.34  % CPUTime    : 
% 0.20/0.46  Running first-order model finding
% 0.20/0.46  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.1eFb2nl9BW/E---3.1_14915.p
% 0.20/0.52  # Version: 3.1pre001
% 0.20/0.52  # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.52  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.52  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.52  # Starting new_bool_3 with 300s (1) cores
% 0.20/0.52  # Starting new_bool_1 with 300s (1) cores
% 0.20/0.52  # Starting sh5l with 300s (1) cores
% 0.20/0.52  # new_bool_3 with pid 14993 completed with status 0
% 0.20/0.52  # Result found by new_bool_3
% 0.20/0.52  # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.52  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.52  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.52  # Starting new_bool_3 with 300s (1) cores
% 0.20/0.52  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.52  # Search class: FGUNM-FFMS21-DFFFFFNN
% 0.20/0.52  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.52  # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.20/0.52  # G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 14998 completed with status 0
% 0.20/0.52  # Result found by G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.20/0.52  # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.52  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.52  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.52  # Starting new_bool_3 with 300s (1) cores
% 0.20/0.52  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.52  # Search class: FGUNM-FFMS21-DFFFFFNN
% 0.20/0.52  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.52  # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.20/0.52  # Preprocessing time       : 0.002 s
% 0.20/0.52  # Presaturation interreduction done
% 0.20/0.52  
% 0.20/0.52  # Proof found!
% 0.20/0.52  # SZS status Unsatisfiable
% 0.20/0.52  # SZS output start CNFRefutation
% See solution above
% 0.20/0.52  # Parsed axioms                        : 36
% 0.20/0.52  # Removed by relevancy pruning/SinE    : 0
% 0.20/0.52  # Initial clauses                      : 36
% 0.20/0.52  # Removed in clause preprocessing      : 0
% 0.20/0.52  # Initial clauses in saturation        : 36
% 0.20/0.52  # Processed clauses                    : 469
% 0.20/0.52  # ...of these trivial                  : 1
% 0.20/0.52  # ...subsumed                          : 171
% 0.20/0.52  # ...remaining for further processing  : 297
% 0.20/0.52  # Other redundant clauses eliminated   : 0
% 0.20/0.52  # Clauses deleted for lack of memory   : 0
% 0.20/0.52  # Backward-subsumed                    : 2
% 0.20/0.52  # Backward-rewritten                   : 1
% 0.20/0.52  # Generated clauses                    : 2055
% 0.20/0.52  # ...of the previous two non-redundant : 1993
% 0.20/0.52  # ...aggressively subsumed             : 0
% 0.20/0.52  # Contextual simplify-reflections      : 0
% 0.20/0.52  # Paramodulations                      : 2055
% 0.20/0.52  # Factorizations                       : 0
% 0.20/0.52  # NegExts                              : 0
% 0.20/0.52  # Equation resolutions                 : 0
% 0.20/0.52  # Total rewrite steps                  : 63
% 0.20/0.52  # Propositional unsat checks           : 0
% 0.20/0.52  #    Propositional check models        : 0
% 0.20/0.52  #    Propositional check unsatisfiable : 0
% 0.20/0.52  #    Propositional clauses             : 0
% 0.20/0.52  #    Propositional clauses after purity: 0
% 0.20/0.52  #    Propositional unsat core size     : 0
% 0.20/0.52  #    Propositional preprocessing time  : 0.000
% 0.20/0.52  #    Propositional encoding time       : 0.000
% 0.20/0.52  #    Propositional solver time         : 0.000
% 0.20/0.52  #    Success case prop preproc time    : 0.000
% 0.20/0.52  #    Success case prop encoding time   : 0.000
% 0.20/0.52  #    Success case prop solver time     : 0.000
% 0.20/0.52  # Current number of processed clauses  : 258
% 0.20/0.52  #    Positive orientable unit clauses  : 14
% 0.20/0.52  #    Positive unorientable unit clauses: 0
% 0.20/0.52  #    Negative unit clauses             : 1
% 0.20/0.52  #    Non-unit-clauses                  : 243
% 0.20/0.52  # Current number of unprocessed clauses: 1596
% 0.20/0.52  # ...number of literals in the above   : 5336
% 0.20/0.52  # Current number of archived formulas  : 0
% 0.20/0.52  # Current number of archived clauses   : 39
% 0.20/0.52  # Clause-clause subsumption calls (NU) : 8986
% 0.20/0.52  # Rec. Clause-clause subsumption calls : 6326
% 0.20/0.52  # Non-unit clause-clause subsumptions  : 170
% 0.20/0.52  # Unit Clause-clause subsumption calls : 28
% 0.20/0.52  # Rewrite failures with RHS unbound    : 0
% 0.20/0.52  # BW rewrite match attempts            : 7
% 0.20/0.52  # BW rewrite match successes           : 1
% 0.20/0.52  # Condensation attempts                : 0
% 0.20/0.52  # Condensation successes               : 0
% 0.20/0.52  # Termbank termtop insertions          : 37963
% 0.20/0.52  
% 0.20/0.52  # -------------------------------------------------
% 0.20/0.52  # User time                : 0.044 s
% 0.20/0.52  # System time              : 0.006 s
% 0.20/0.52  # Total time               : 0.050 s
% 0.20/0.52  # Maximum resident set size: 1808 pages
% 0.20/0.52  
% 0.20/0.52  # -------------------------------------------------
% 0.20/0.52  # User time                : 0.045 s
% 0.20/0.52  # System time              : 0.008 s
% 0.20/0.52  # Total time               : 0.054 s
% 0.20/0.52  # Maximum resident set size: 1728 pages
% 0.20/0.52  % E---3.1 exiting
%------------------------------------------------------------------------------