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

View Problem - Process Solution

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

% Computer : n002.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   : Timeout 136.35s 300.24s
% Output   : None 
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    8
% Syntax   : Number of clauses     :   22 (  11 unt;   5 nHn;  15 RR)
%            Number of literals    :   40 (   0 equ;  14 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    6 (   2 avg)
%            Number of predicates  :    5 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :   16 (  16 usr;   7 con; 0-3 aty)
%            Number of variables   :   36 (   6 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(p21_27,negated_conjecture,
    ( p21(f12(f13(c28,c29)),f12(f13(c28,X1)))
    | ~ p22(X1,f15(f6(c25,f7(c23,c26)))) ),
    file('/export/starexec/sandbox/tmp/tmp.hEzXJiBJ22/E---3.1_31073.p',p21_27) ).

cnf(p3_34,negated_conjecture,
    ( p3(f4(X1),f8(c24))
    | p22(f20(X1,X2,X3),f15(X1))
    | p10(f11(X1,c27,X2),f11(X1,c27,X3)) ),
    file('/export/starexec/sandbox/tmp/tmp.hEzXJiBJ22/E---3.1_31073.p',p3_34) ).

cnf(p3_17,negated_conjecture,
    ( p3(X1,X2)
    | ~ p3(X3,X1)
    | ~ p3(X3,X2) ),
    file('/export/starexec/sandbox/tmp/tmp.hEzXJiBJ22/E---3.1_31073.p',p3_17) ).

cnf(p3_8,negated_conjecture,
    p3(f4(f6(X1,f7(X2,X3))),X2),
    file('/export/starexec/sandbox/tmp/tmp.hEzXJiBJ22/E---3.1_31073.p',p3_8) ).

cnf(p3_37,negated_conjecture,
    ( p3(f4(X1),f8(c24))
    | p10(f11(X1,c27,X2),f11(X1,c27,X3))
    | ~ p21(f12(f13(X2,X3)),f12(f13(X2,f20(X1,X2,X3)))) ),
    file('/export/starexec/sandbox/tmp/tmp.hEzXJiBJ22/E---3.1_31073.p',p3_37) ).

cnf(not_p10_25,negated_conjecture,
    ~ p10(f11(f6(c25,f7(c23,c26)),c27,c28),f11(f6(c25,f7(c23,c26)),c27,c29)),
    file('/export/starexec/sandbox/tmp/tmp.hEzXJiBJ22/E---3.1_31073.p',not_p10_25) ).

cnf(p3_4,negated_conjecture,
    p3(X1,X1),
    file('/export/starexec/sandbox/tmp/tmp.hEzXJiBJ22/E---3.1_31073.p',p3_4) ).

cnf(not_p3_7,negated_conjecture,
    ~ p3(c23,f8(c24)),
    file('/export/starexec/sandbox/tmp/tmp.hEzXJiBJ22/E---3.1_31073.p',not_p3_7) ).

cnf(c_0_8,negated_conjecture,
    ( p21(f12(f13(c28,c29)),f12(f13(c28,X1)))
    | ~ p22(X1,f15(f6(c25,f7(c23,c26)))) ),
    p21_27 ).

cnf(c_0_9,negated_conjecture,
    ( p3(f4(X1),f8(c24))
    | p22(f20(X1,X2,X3),f15(X1))
    | p10(f11(X1,c27,X2),f11(X1,c27,X3)) ),
    p3_34 ).

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

cnf(c_0_11,negated_conjecture,
    p3(f4(f6(X1,f7(X2,X3))),X2),
    p3_8 ).

cnf(c_0_12,negated_conjecture,
    ( p3(f4(X1),f8(c24))
    | p10(f11(X1,c27,X2),f11(X1,c27,X3))
    | ~ p21(f12(f13(X2,X3)),f12(f13(X2,f20(X1,X2,X3)))) ),
    p3_37 ).

cnf(c_0_13,negated_conjecture,
    ( p21(f12(f13(c28,c29)),f12(f13(c28,f20(f6(c25,f7(c23,c26)),X1,X2))))
    | p3(f4(f6(c25,f7(c23,c26))),f8(c24))
    | p10(f11(f6(c25,f7(c23,c26)),c27,X1),f11(f6(c25,f7(c23,c26)),c27,X2)) ),
    inference(spm,[status(thm)],[c_0_8,c_0_9]) ).

cnf(c_0_14,negated_conjecture,
    ~ p10(f11(f6(c25,f7(c23,c26)),c27,c28),f11(f6(c25,f7(c23,c26)),c27,c29)),
    not_p10_25 ).

cnf(c_0_15,negated_conjecture,
    p3(X1,X1),
    p3_4 ).

cnf(c_0_16,negated_conjecture,
    ( p3(X1,X2)
    | ~ p3(f4(f6(X3,f7(X2,X4))),X1) ),
    inference(spm,[status(thm)],[c_0_10,c_0_11]) ).

cnf(c_0_17,negated_conjecture,
    p3(f4(f6(c25,f7(c23,c26))),f8(c24)),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]) ).

cnf(c_0_18,negated_conjecture,
    ( p3(X1,X2)
    | ~ p3(X2,X1) ),
    inference(spm,[status(thm)],[c_0_10,c_0_15]) ).

cnf(c_0_19,negated_conjecture,
    p3(f8(c24),c23),
    inference(spm,[status(thm)],[c_0_16,c_0_17]) ).

cnf(c_0_20,negated_conjecture,
    ~ p3(c23,f8(c24)),
    not_p3_7 ).

cnf(c_0_21,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.13  % Problem    : SYN636-1 : TPTP v8.1.2. Released v2.5.0.
% 0.10/0.14  % Command    : run_E %s %d THM
% 0.12/0.35  % Computer : n002.cluster.edu
% 0.12/0.35  % Model    : x86_64 x86_64
% 0.12/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.35  % Memory   : 8042.1875MB
% 0.12/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.35  % CPULimit   : 2400
% 0.12/0.35  % WCLimit    : 300
% 0.12/0.35  % DateTime   : Mon Oct  2 19:00:29 EDT 2023
% 0.12/0.35  % CPUTime    : 
% 0.18/0.48  Running first-order model finding
% 0.18/0.48  Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.hEzXJiBJ22/E---3.1_31073.p
% 136.35/300.24  # Version: 3.1pre001
% 136.35/300.24  # Preprocessing class: FSMSSMSMSSSNFFN.
% 136.35/300.24  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 136.35/300.24  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 136.35/300.24  # Starting new_bool_3 with 300s (1) cores
% 136.35/300.24  # Starting new_bool_1 with 300s (1) cores
% 136.35/300.24  # Starting sh5l with 300s (1) cores
% 136.35/300.24  # sh5l with pid 31176 completed with status 0
% 136.35/300.24  # Result found by sh5l
% 136.35/300.24  # Preprocessing class: FSMSSMSMSSSNFFN.
% 136.35/300.24  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 136.35/300.24  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 136.35/300.24  # Starting new_bool_3 with 300s (1) cores
% 136.35/300.24  # Starting new_bool_1 with 300s (1) cores
% 136.35/300.24  # Starting sh5l with 300s (1) cores
% 136.35/300.24  # SinE strategy is gf500_gu_R04_F100_L20000
% 136.35/300.24  # Search class: FGUNM-FFMF32-MFFFFFNN
% 136.35/300.24  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 136.35/300.24  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 136.35/300.24  # SAT001_MinMin_p005000_rr_RG with pid 31179 completed with status 0
% 136.35/300.24  # Result found by SAT001_MinMin_p005000_rr_RG
% 136.35/300.24  # Preprocessing class: FSMSSMSMSSSNFFN.
% 136.35/300.24  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 136.35/300.24  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 136.35/300.24  # Starting new_bool_3 with 300s (1) cores
% 136.35/300.24  # Starting new_bool_1 with 300s (1) cores
% 136.35/300.24  # Starting sh5l with 300s (1) cores
% 136.35/300.24  # SinE strategy is gf500_gu_R04_F100_L20000
% 136.35/300.24  # Search class: FGUNM-FFMF32-MFFFFFNN
% 136.35/300.24  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 136.35/300.24  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 136.35/300.24  # Preprocessing time       : 0.002 s
% 136.35/300.24  # Presaturation interreduction done
% 136.35/300.24  
% 136.35/300.24  # Proof found!
% 136.35/300.24  # SZS status Unsatisfiable
% 136.35/300.24  # SZS output start CNFRefutation
% See solution above
% 136.35/300.24  # Parsed axioms                        : 40
% 136.35/300.24  # Removed by relevancy pruning/SinE    : 0
% 136.35/300.24  # Initial clauses                      : 40
% 136.35/300.24  # Removed in clause preprocessing      : 0
% 136.35/300.24  # Initial clauses in saturation        : 40
% 136.35/300.24  # Processed clauses                    : 272
% 136.35/300.24  # ...of these trivial                  : 0
% 136.35/300.24  # ...subsumed                          : 80
% 136.35/300.24  # ...remaining for further processing  : 192
% 136.35/300.24  # Other redundant clauses eliminated   : 0
% 136.35/300.24  # Clauses deleted for lack of memory   : 0
% 136.35/300.24  # Backward-subsumed                    : 0
% 136.35/300.24  # Backward-rewritten                   : 1
% 136.35/300.24  # Generated clauses                    : 553
% 136.35/300.24  # ...of the previous two non-redundant : 531
% 136.35/300.24  # ...aggressively subsumed             : 0
% 136.35/300.24  # Contextual simplify-reflections      : 0
% 136.35/300.24  # Paramodulations                      : 553
% 136.35/300.24  # Factorizations                       : 0
% 136.35/300.24  # NegExts                              : 0
% 136.35/300.24  # Equation resolutions                 : 0
% 136.35/300.24  # Total rewrite steps                  : 14
% 136.35/300.24  # Propositional unsat checks           : 0
% 136.35/300.24  #    Propositional check models        : 0
% 136.35/300.24  #    Propositional check unsatisfiable : 0
% 136.35/300.24  #    Propositional clauses             : 0
% 136.35/300.24  #    Propositional clauses after purity: 0
% 136.35/300.24  #    Propositional unsat core size     : 0
% 136.35/300.24  #    Propositional preprocessing time  : 0.000
% 136.35/300.24  #    Propositional encoding time       : 0.000
% 136.35/300.24  #    Propositional solver time         : 0.000
% 136.35/300.24  #    Success case prop preproc time    : 0.000
% 136.35/300.24  #    Success case prop encoding time   : 0.000
% 136.35/300.24  #    Success case prop solver time     : 0.000
% 136.35/300.24  # Current number of processed clauses  : 151
% 136.35/300.24  #    Positive orientable unit clauses  : 10
% 136.35/300.24  #    Positive unorientable unit clauses: 0
% 136.35/300.24  #    Negative unit clauses             : 2
% 136.35/300.24  #    Non-unit-clauses                  : 139
% 136.35/300.24  # Current number of unprocessed clauses: 336
% 136.35/300.24  # ...number of literals in the above   : 1172
% 136.35/300.24  # Current number of archived formulas  : 0
% 136.35/300.24  # Current number of archived clauses   : 41
% 136.35/300.24  # Clause-clause subsumption calls (NU) : 3918
% 136.35/300.24  # Rec. Clause-clause subsumption calls : 3535
% 136.35/300.24  # Non-unit clause-clause subsumptions  : 80
% 136.35/300.24  # Unit Clause-clause subsumption calls : 23
% 136.35/300.24  # Rewrite failures with RHS unbound    : 0
% 136.35/300.24  # BW rewrite match attempts            : 4
% 136.35/300.24  # BW rewrite match successes           : 1
% 136.35/300.24  # Condensation attempts                : 0
% 136.35/300.24  # Condensation successes               : 0
% 136.35/300.24  # Termbank termtop insertions          : 9720
% 136.35/300.24  
% 136.35/300.24  # -------------------------------------------------
% 136.35/300.24  # User time                : 0.019 s
% 136.35/300.24  # System time              : 0.003 s
% 136.35/300.24  # Total time               : 0.022 s
% 136.35/300.24  # Maximum resident set size: 1756 pages
% 136.35/300.24  
% 136.35/300.24  # -------------------------------------------------
% 136.35/300.24  # User time                : 0.022 s
% 136.35/300.24  # System time              : 0.003 s
% 136.35/300.24  # Total time               : 0.026 s
% 136.35/300.24  # Maximum resident set size: 1720 pages
% 136.35/300.24  % E---3.1 exiting
%------------------------------------------------------------------------------