TSTP Solution File: SYN633-1 by E-SAT---3.1.00

View Problem - Process Solution

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

% Computer : n025.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 : 300s
% WCLimit  : 300s
% DateTime : Tue May 21 08:00:48 EDT 2024

% Result   : Unsatisfiable 0.51s 0.55s
% Output   : CNFRefutation 0.51s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    8
% Syntax   : Number of clauses     :   27 (  13 unt;   6 nHn;  20 RR)
%            Number of literals    :   50 (   0 equ;  20 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   :   43 (   6 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(p21_26,negated_conjecture,
    ( p21(f12(f13(c28,c29)),f12(f13(c28,X1)))
    | ~ p22(X1,f16(f6(c25,f7(c23,c26)))) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p21_26) ).

cnf(p3_17,negated_conjecture,
    ( p3(X1,X2)
    | ~ p3(X3,X1)
    | ~ p3(X3,X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p3_17) ).

cnf(p3_38,negated_conjecture,
    ( p3(f4(X1),f8(c24))
    | p10(f11(X1,c27,X2),f11(X1,c27,X3))
    | ~ p21(f12(f13(X2,X3)),f12(f13(X2,f17(X1,X2,X3)))) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p3_38) ).

cnf(p3_33,negated_conjecture,
    ( p3(f4(X1),f8(c24))
    | p22(f17(X1,X2,X3),f16(X1))
    | p10(f11(X1,c27,X2),f11(X1,c27,X3)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p3_33) ).

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/benchmark/theBenchmark.p',not_p10_25) ).

cnf(p3_8,negated_conjecture,
    p3(f4(f6(X1,f7(X2,X3))),X2),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p3_8) ).

cnf(p3_4,negated_conjecture,
    p3(X1,X1),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p3_4) ).

cnf(not_p3_7,negated_conjecture,
    ~ p3(c23,f8(c24)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_p3_7) ).

cnf(c_0_8,negated_conjecture,
    ( p21(f12(f13(c28,c29)),f12(f13(c28,X1)))
    | ~ p22(X1,f16(f6(c25,f7(c23,c26)))) ),
    inference(fof_simplification,[status(thm)],[p21_26]) ).

cnf(c_0_9,negated_conjecture,
    ( p3(X1,X2)
    | ~ p3(X3,X1)
    | ~ p3(X3,X2) ),
    inference(fof_simplification,[status(thm)],[p3_17]) ).

cnf(c_0_10,negated_conjecture,
    ( p3(f4(X1),f8(c24))
    | p10(f11(X1,c27,X2),f11(X1,c27,X3))
    | ~ p21(f12(f13(X2,X3)),f12(f13(X2,f17(X1,X2,X3)))) ),
    inference(fof_simplification,[status(thm)],[p3_38]) ).

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

cnf(c_0_12,negated_conjecture,
    ( p3(f4(X1),f8(c24))
    | p22(f17(X1,X2,X3),f16(X1))
    | p10(f11(X1,c27,X2),f11(X1,c27,X3)) ),
    p3_33 ).

cnf(c_0_13,negated_conjecture,
    ~ p10(f11(f6(c25,f7(c23,c26)),c27,c28),f11(f6(c25,f7(c23,c26)),c27,c29)),
    inference(fof_simplification,[status(thm)],[not_p10_25]) ).

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

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

cnf(c_0_16,negated_conjecture,
    ( p3(f4(X1),f8(c24))
    | p10(f11(X1,c27,X2),f11(X1,c27,X3))
    | ~ p21(f12(f13(X2,X3)),f12(f13(X2,f17(X1,X2,X3)))) ),
    c_0_10 ).

cnf(c_0_17,negated_conjecture,
    ( p21(f12(f13(c28,c29)),f12(f13(c28,f17(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_11,c_0_12]) ).

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

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

cnf(c_0_20,negated_conjecture,
    ( p3(X1,X2)
    | ~ p3(f4(f6(X3,f7(X2,X4))),X1) ),
    inference(spm,[status(thm)],[c_0_14,c_0_15]) ).

cnf(c_0_21,negated_conjecture,
    p3(f4(f6(c25,f7(c23,c26))),f8(c24)),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]) ).

cnf(c_0_22,negated_conjecture,
    ~ p3(c23,f8(c24)),
    inference(fof_simplification,[status(thm)],[not_p3_7]) ).

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

cnf(c_0_24,negated_conjecture,
    p3(f8(c24),c23),
    inference(spm,[status(thm)],[c_0_20,c_0_21]) ).

cnf(c_0_25,negated_conjecture,
    ~ p3(c23,f8(c24)),
    c_0_22 ).

cnf(c_0_26,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.14  % Problem    : SYN633-1 : TPTP v8.2.0. Released v2.5.0.
% 0.16/0.15  % Command    : run_E %s %d THM
% 0.16/0.37  % Computer : n025.cluster.edu
% 0.16/0.37  % Model    : x86_64 x86_64
% 0.16/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37  % Memory   : 8042.1875MB
% 0.16/0.37  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37  % CPULimit   : 300
% 0.16/0.37  % WCLimit    : 300
% 0.16/0.37  % DateTime   : Mon May 20 15:54:53 EDT 2024
% 0.16/0.37  % CPUTime    : 
% 0.24/0.52  Running first-order model finding
% 0.24/0.52  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/benchmark/theBenchmark.p
% 0.51/0.55  # Version: 3.1.0
% 0.51/0.55  # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.51/0.55  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.51/0.55  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.51/0.55  # Starting new_bool_3 with 300s (1) cores
% 0.51/0.55  # Starting new_bool_1 with 300s (1) cores
% 0.51/0.55  # Starting sh5l with 300s (1) cores
% 0.51/0.55  # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 28750 completed with status 0
% 0.51/0.55  # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.51/0.55  # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.51/0.55  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.51/0.55  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.51/0.55  # No SInE strategy applied
% 0.51/0.55  # Search class: FGUNM-FFMF32-MFFFFFNN
% 0.51/0.55  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.51/0.55  # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.51/0.55  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.51/0.55  # Starting new_bool_3 with 136s (1) cores
% 0.51/0.55  # Starting new_bool_1 with 136s (1) cores
% 0.51/0.55  # Starting sh5l with 136s (1) cores
% 0.51/0.55  # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 28755 completed with status 0
% 0.51/0.55  # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.51/0.55  # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.51/0.55  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.51/0.55  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.51/0.55  # No SInE strategy applied
% 0.51/0.55  # Search class: FGUNM-FFMF32-MFFFFFNN
% 0.51/0.55  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.51/0.55  # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.51/0.55  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.51/0.55  # Preprocessing time       : 0.002 s
% 0.51/0.55  # Presaturation interreduction done
% 0.51/0.55  
% 0.51/0.55  # Proof found!
% 0.51/0.55  # SZS status Unsatisfiable
% 0.51/0.55  # SZS output start CNFRefutation
% See solution above
% 0.51/0.55  # Parsed axioms                        : 40
% 0.51/0.55  # Removed by relevancy pruning/SinE    : 0
% 0.51/0.55  # Initial clauses                      : 40
% 0.51/0.55  # Removed in clause preprocessing      : 0
% 0.51/0.55  # Initial clauses in saturation        : 40
% 0.51/0.55  # Processed clauses                    : 162
% 0.51/0.55  # ...of these trivial                  : 5
% 0.51/0.55  # ...subsumed                          : 0
% 0.51/0.55  # ...remaining for further processing  : 157
% 0.51/0.55  # Other redundant clauses eliminated   : 0
% 0.51/0.55  # Clauses deleted for lack of memory   : 0
% 0.51/0.55  # Backward-subsumed                    : 0
% 0.51/0.55  # Backward-rewritten                   : 8
% 0.51/0.55  # Generated clauses                    : 437
% 0.51/0.55  # ...of the previous two non-redundant : 382
% 0.51/0.55  # ...aggressively subsumed             : 0
% 0.51/0.55  # Contextual simplify-reflections      : 0
% 0.51/0.55  # Paramodulations                      : 437
% 0.51/0.55  # Factorizations                       : 0
% 0.51/0.55  # NegExts                              : 0
% 0.51/0.55  # Equation resolutions                 : 0
% 0.51/0.55  # Disequality decompositions           : 0
% 0.51/0.55  # Total rewrite steps                  : 62
% 0.51/0.55  # ...of those cached                   : 19
% 0.51/0.55  # Propositional unsat checks           : 0
% 0.51/0.55  #    Propositional check models        : 0
% 0.51/0.55  #    Propositional check unsatisfiable : 0
% 0.51/0.55  #    Propositional clauses             : 0
% 0.51/0.55  #    Propositional clauses after purity: 0
% 0.51/0.55  #    Propositional unsat core size     : 0
% 0.51/0.55  #    Propositional preprocessing time  : 0.000
% 0.51/0.55  #    Propositional encoding time       : 0.000
% 0.51/0.55  #    Propositional solver time         : 0.000
% 0.51/0.55  #    Success case prop preproc time    : 0.000
% 0.51/0.55  #    Success case prop encoding time   : 0.000
% 0.51/0.55  #    Success case prop solver time     : 0.000
% 0.51/0.55  # Current number of processed clauses  : 109
% 0.51/0.55  #    Positive orientable unit clauses  : 29
% 0.51/0.55  #    Positive unorientable unit clauses: 0
% 0.51/0.55  #    Negative unit clauses             : 2
% 0.51/0.55  #    Non-unit-clauses                  : 78
% 0.51/0.55  # Current number of unprocessed clauses: 290
% 0.51/0.55  # ...number of literals in the above   : 436
% 0.51/0.55  # Current number of archived formulas  : 0
% 0.51/0.55  # Current number of archived clauses   : 48
% 0.51/0.55  # Clause-clause subsumption calls (NU) : 1086
% 0.51/0.55  # Rec. Clause-clause subsumption calls : 887
% 0.51/0.55  # Non-unit clause-clause subsumptions  : 0
% 0.51/0.55  # Unit Clause-clause subsumption calls : 102
% 0.51/0.55  # Rewrite failures with RHS unbound    : 0
% 0.51/0.55  # BW rewrite match attempts            : 30
% 0.51/0.55  # BW rewrite match successes           : 3
% 0.51/0.55  # Condensation attempts                : 0
% 0.51/0.55  # Condensation successes               : 0
% 0.51/0.55  # Termbank termtop insertions          : 10276
% 0.51/0.55  # Search garbage collected termcells   : 117
% 0.51/0.55  
% 0.51/0.55  # -------------------------------------------------
% 0.51/0.55  # User time                : 0.015 s
% 0.51/0.55  # System time              : 0.004 s
% 0.51/0.55  # Total time               : 0.019 s
% 0.51/0.55  # Maximum resident set size: 1760 pages
% 0.51/0.55  
% 0.51/0.55  # -------------------------------------------------
% 0.51/0.55  # User time                : 0.079 s
% 0.51/0.55  # System time              : 0.007 s
% 0.51/0.55  # Total time               : 0.087 s
% 0.51/0.55  # Maximum resident set size: 1736 pages
% 0.51/0.55  % E---3.1 exiting
%------------------------------------------------------------------------------