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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E-SAT---3.1.00
% Problem  : SYN625-1 : TPTP v8.2.0. 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 : 300s
% WCLimit  : 300s
% DateTime : Tue May 21 08:00:46 EDT 2024

% Result   : Unsatisfiable 0.32s 0.57s
% Output   : CNFRefutation 0.32s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    9
% Syntax   : Number of clauses     :   35 (  12 unt;  13 nHn;  33 RR)
%            Number of literals    :   70 (   0 equ;  32 neg)
%            Maximal clause size   :    3 (   2 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    5 (   4 usr;   1 prp; 0-3 aty)
%            Number of functors    :    9 (   9 usr;   3 con; 0-5 aty)
%            Number of variables   :   69 (   3 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(f4_is_not_p15_8,negated_conjecture,
    ~ p15(f4(f7(c19,c20),c21)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f4_is_not_p15_8) ).

cnf(p16_32,negated_conjecture,
    ( p16(f9(X1),X2,X3)
    | p18(f9(X1),X2,X4)
    | ~ p18(f9(f4(f7(X3,X5),X1)),X2,X4) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p16_32) ).

cnf(p15_15,negated_conjecture,
    ( p15(X1)
    | p18(f9(X1),f14(X1),f14(X1)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p15_15) ).

cnf(not_p15_10,negated_conjecture,
    ( ~ p15(X1)
    | ~ p18(f9(X1),X2,X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not_p15_10) ).

cnf(p18_34,negated_conjecture,
    ( p18(f9(X1),X2,X3)
    | p16(f9(X1),f12(X1,X4,X5,X2,X3),X3)
    | ~ p18(f9(f4(f7(X4,X5),X1)),X2,X3) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p18_34) ).

cnf(p16_23,negated_conjecture,
    ( p16(X1,X2,X3)
    | ~ p16(X1,X2,X4)
    | ~ p16(X1,X4,X3) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p16_23) ).

cnf(c21_is_p15_1,negated_conjecture,
    p15(c21),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c21_is_p15_1) ).

cnf(not_p17_16,negated_conjecture,
    ( ~ p17(X1,f11(c20))
    | ~ p16(f9(c21),X1,c19) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not_p17_16) ).

cnf(p18_33,negated_conjecture,
    ( p18(f9(X1),X2,X3)
    | p17(f12(X1,X4,X5,X2,X3),f11(X5))
    | ~ p18(f9(f4(f7(X4,X5),X1)),X2,X3) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p18_33) ).

cnf(c_0_9,negated_conjecture,
    ~ p15(f4(f7(c19,c20),c21)),
    inference(fof_simplification,[status(thm)],[f4_is_not_p15_8]) ).

cnf(c_0_10,negated_conjecture,
    ( p16(f9(X1),X2,X3)
    | p18(f9(X1),X2,X4)
    | ~ p18(f9(f4(f7(X3,X5),X1)),X2,X4) ),
    inference(fof_simplification,[status(thm)],[p16_32]) ).

cnf(c_0_11,negated_conjecture,
    ~ p15(f4(f7(c19,c20),c21)),
    c_0_9 ).

cnf(c_0_12,negated_conjecture,
    ( p15(X1)
    | p18(f9(X1),f14(X1),f14(X1)) ),
    p15_15 ).

cnf(c_0_13,negated_conjecture,
    ( ~ p15(X1)
    | ~ p18(f9(X1),X2,X2) ),
    inference(fof_simplification,[status(thm)],[not_p15_10]) ).

cnf(c_0_14,negated_conjecture,
    ( p16(f9(X1),X2,X3)
    | p18(f9(X1),X2,X4)
    | ~ p18(f9(f4(f7(X3,X5),X1)),X2,X4) ),
    c_0_10 ).

cnf(c_0_15,negated_conjecture,
    p18(f9(f4(f7(c19,c20),c21)),f14(f4(f7(c19,c20),c21)),f14(f4(f7(c19,c20),c21))),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_16,negated_conjecture,
    ( p18(f9(X1),X2,X3)
    | p16(f9(X1),f12(X1,X4,X5,X2,X3),X3)
    | ~ p18(f9(f4(f7(X4,X5),X1)),X2,X3) ),
    inference(fof_simplification,[status(thm)],[p18_34]) ).

cnf(c_0_17,negated_conjecture,
    ( p16(X1,X2,X3)
    | ~ p16(X1,X2,X4)
    | ~ p16(X1,X4,X3) ),
    inference(fof_simplification,[status(thm)],[p16_23]) ).

cnf(c_0_18,negated_conjecture,
    ( ~ p15(X1)
    | ~ p18(f9(X1),X2,X2) ),
    c_0_13 ).

cnf(c_0_19,negated_conjecture,
    ( p18(f9(c21),f14(f4(f7(c19,c20),c21)),f14(f4(f7(c19,c20),c21)))
    | p16(f9(c21),f14(f4(f7(c19,c20),c21)),c19) ),
    inference(spm,[status(thm)],[c_0_14,c_0_15]) ).

cnf(c_0_20,negated_conjecture,
    p15(c21),
    c21_is_p15_1 ).

cnf(c_0_21,negated_conjecture,
    ( p18(f9(X1),X2,X3)
    | p16(f9(X1),f12(X1,X4,X5,X2,X3),X3)
    | ~ p18(f9(f4(f7(X4,X5),X1)),X2,X3) ),
    c_0_16 ).

cnf(c_0_22,negated_conjecture,
    ( p16(X1,X2,X3)
    | ~ p16(X1,X2,X4)
    | ~ p16(X1,X4,X3) ),
    c_0_17 ).

cnf(c_0_23,negated_conjecture,
    p16(f9(c21),f14(f4(f7(c19,c20),c21)),c19),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20])]) ).

cnf(c_0_24,negated_conjecture,
    ( p18(f9(c21),f14(f4(f7(c19,c20),c21)),f14(f4(f7(c19,c20),c21)))
    | p16(f9(c21),f12(c21,c19,c20,f14(f4(f7(c19,c20),c21)),f14(f4(f7(c19,c20),c21))),f14(f4(f7(c19,c20),c21))) ),
    inference(spm,[status(thm)],[c_0_21,c_0_15]) ).

cnf(c_0_25,negated_conjecture,
    ( ~ p17(X1,f11(c20))
    | ~ p16(f9(c21),X1,c19) ),
    inference(fof_simplification,[status(thm)],[not_p17_16]) ).

cnf(c_0_26,negated_conjecture,
    ( p16(f9(c21),X1,c19)
    | ~ p16(f9(c21),X1,f14(f4(f7(c19,c20),c21))) ),
    inference(spm,[status(thm)],[c_0_22,c_0_23]) ).

cnf(c_0_27,negated_conjecture,
    p16(f9(c21),f12(c21,c19,c20,f14(f4(f7(c19,c20),c21)),f14(f4(f7(c19,c20),c21))),f14(f4(f7(c19,c20),c21))),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_24]),c_0_20])]) ).

cnf(c_0_28,negated_conjecture,
    ( ~ p17(X1,f11(c20))
    | ~ p16(f9(c21),X1,c19) ),
    c_0_25 ).

cnf(c_0_29,negated_conjecture,
    p16(f9(c21),f12(c21,c19,c20,f14(f4(f7(c19,c20),c21)),f14(f4(f7(c19,c20),c21))),c19),
    inference(spm,[status(thm)],[c_0_26,c_0_27]) ).

cnf(c_0_30,negated_conjecture,
    ( p18(f9(X1),X2,X3)
    | p17(f12(X1,X4,X5,X2,X3),f11(X5))
    | ~ p18(f9(f4(f7(X4,X5),X1)),X2,X3) ),
    inference(fof_simplification,[status(thm)],[p18_33]) ).

cnf(c_0_31,negated_conjecture,
    ~ p17(f12(c21,c19,c20,f14(f4(f7(c19,c20),c21)),f14(f4(f7(c19,c20),c21))),f11(c20)),
    inference(spm,[status(thm)],[c_0_28,c_0_29]) ).

cnf(c_0_32,negated_conjecture,
    ( p18(f9(X1),X2,X3)
    | p17(f12(X1,X4,X5,X2,X3),f11(X5))
    | ~ p18(f9(f4(f7(X4,X5),X1)),X2,X3) ),
    c_0_30 ).

cnf(c_0_33,negated_conjecture,
    p18(f9(c21),f14(f4(f7(c19,c20),c21)),f14(f4(f7(c19,c20),c21))),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_15])]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13  % Problem    : SYN625-1 : TPTP v8.2.0. Released v2.5.0.
% 0.08/0.14  % Command    : run_E %s %d THM
% 0.13/0.35  % Computer : n016.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit   : 300
% 0.13/0.35  % WCLimit    : 300
% 0.13/0.35  % DateTime   : Mon May 20 15:37:53 EDT 2024
% 0.13/0.35  % CPUTime    : 
% 0.32/0.55  Running first-order model finding
% 0.32/0.55  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/benchmark/theBenchmark.p
% 0.32/0.57  # Version: 3.1.0
% 0.32/0.57  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.32/0.57  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.32/0.57  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.32/0.57  # Starting new_bool_3 with 300s (1) cores
% 0.32/0.57  # Starting new_bool_1 with 300s (1) cores
% 0.32/0.57  # Starting sh5l with 300s (1) cores
% 0.32/0.57  # new_bool_3 with pid 23480 completed with status 0
% 0.32/0.57  # Result found by new_bool_3
% 0.32/0.57  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.32/0.57  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.32/0.57  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.32/0.57  # Starting new_bool_3 with 300s (1) cores
% 0.32/0.57  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.32/0.57  # Search class: FGHNM-FFMF32-MFFFFFNN
% 0.32/0.57  # partial match(1): FGHSM-FFMF32-MFFFFFNN
% 0.32/0.57  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.32/0.57  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S038I with 181s (1) cores
% 0.32/0.57  # G-E--_208_C18_F1_SE_CS_SP_PS_S038I with pid 23486 completed with status 0
% 0.32/0.57  # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S038I
% 0.32/0.57  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.32/0.57  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.32/0.57  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.32/0.57  # Starting new_bool_3 with 300s (1) cores
% 0.32/0.57  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.32/0.57  # Search class: FGHNM-FFMF32-MFFFFFNN
% 0.32/0.57  # partial match(1): FGHSM-FFMF32-MFFFFFNN
% 0.32/0.57  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.32/0.57  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S038I with 181s (1) cores
% 0.32/0.57  # Preprocessing time       : 0.001 s
% 0.32/0.57  # Presaturation interreduction done
% 0.32/0.57  
% 0.32/0.57  # Proof found!
% 0.32/0.57  # SZS status Unsatisfiable
% 0.32/0.57  # SZS output start CNFRefutation
% See solution above
% 0.32/0.57  # Parsed axioms                        : 35
% 0.32/0.57  # Removed by relevancy pruning/SinE    : 0
% 0.32/0.57  # Initial clauses                      : 35
% 0.32/0.57  # Removed in clause preprocessing      : 0
% 0.32/0.57  # Initial clauses in saturation        : 35
% 0.32/0.57  # Processed clauses                    : 146
% 0.32/0.57  # ...of these trivial                  : 0
% 0.32/0.57  # ...subsumed                          : 18
% 0.32/0.57  # ...remaining for further processing  : 128
% 0.32/0.57  # Other redundant clauses eliminated   : 0
% 0.32/0.57  # Clauses deleted for lack of memory   : 0
% 0.32/0.57  # Backward-subsumed                    : 1
% 0.32/0.57  # Backward-rewritten                   : 2
% 0.32/0.57  # Generated clauses                    : 146
% 0.32/0.57  # ...of the previous two non-redundant : 133
% 0.32/0.57  # ...aggressively subsumed             : 0
% 0.32/0.57  # Contextual simplify-reflections      : 0
% 0.32/0.57  # Paramodulations                      : 146
% 0.32/0.57  # Factorizations                       : 0
% 0.32/0.57  # NegExts                              : 0
% 0.32/0.57  # Equation resolutions                 : 0
% 0.32/0.57  # Disequality decompositions           : 0
% 0.32/0.57  # Total rewrite steps                  : 20
% 0.32/0.57  # ...of those cached                   : 7
% 0.32/0.57  # Propositional unsat checks           : 0
% 0.32/0.57  #    Propositional check models        : 0
% 0.32/0.57  #    Propositional check unsatisfiable : 0
% 0.32/0.57  #    Propositional clauses             : 0
% 0.32/0.57  #    Propositional clauses after purity: 0
% 0.32/0.57  #    Propositional unsat core size     : 0
% 0.32/0.57  #    Propositional preprocessing time  : 0.000
% 0.32/0.57  #    Propositional encoding time       : 0.000
% 0.32/0.57  #    Propositional solver time         : 0.000
% 0.32/0.57  #    Success case prop preproc time    : 0.000
% 0.32/0.57  #    Success case prop encoding time   : 0.000
% 0.32/0.57  #    Success case prop solver time     : 0.000
% 0.32/0.57  # Current number of processed clauses  : 90
% 0.32/0.57  #    Positive orientable unit clauses  : 12
% 0.32/0.57  #    Positive unorientable unit clauses: 0
% 0.32/0.57  #    Negative unit clauses             : 4
% 0.32/0.57  #    Non-unit-clauses                  : 74
% 0.32/0.57  # Current number of unprocessed clauses: 56
% 0.32/0.57  # ...number of literals in the above   : 201
% 0.32/0.57  # Current number of archived formulas  : 0
% 0.32/0.57  # Current number of archived clauses   : 38
% 0.32/0.57  # Clause-clause subsumption calls (NU) : 969
% 0.32/0.57  # Rec. Clause-clause subsumption calls : 585
% 0.32/0.57  # Non-unit clause-clause subsumptions  : 13
% 0.32/0.57  # Unit Clause-clause subsumption calls : 7
% 0.32/0.57  # Rewrite failures with RHS unbound    : 0
% 0.32/0.57  # BW rewrite match attempts            : 3
% 0.32/0.57  # BW rewrite match successes           : 2
% 0.32/0.57  # Condensation attempts                : 0
% 0.32/0.57  # Condensation successes               : 0
% 0.32/0.57  # Termbank termtop insertions          : 4355
% 0.32/0.57  # Search garbage collected termcells   : 139
% 0.32/0.57  
% 0.32/0.57  # -------------------------------------------------
% 0.32/0.57  # User time                : 0.010 s
% 0.32/0.57  # System time              : 0.003 s
% 0.32/0.57  # Total time               : 0.014 s
% 0.32/0.57  # Maximum resident set size: 1724 pages
% 0.32/0.57  
% 0.32/0.57  # -------------------------------------------------
% 0.32/0.57  # User time                : 0.012 s
% 0.32/0.57  # System time              : 0.005 s
% 0.32/0.57  # Total time               : 0.018 s
% 0.32/0.57  # Maximum resident set size: 1736 pages
% 0.32/0.57  % E---3.1 exiting
%------------------------------------------------------------------------------