TSTP Solution File: SYN642-1 by E---3.1.00

View Problem - Process Solution

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

% Computer : n012.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 07:47:10 EDT 2024

% Result   : Unsatisfiable 0.13s 0.53s
% Output   : CNFRefutation 0.13s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    9
% Syntax   : Number of clauses     :   27 (  14 unt;   0 nHn;  25 RR)
%            Number of literals    :   55 (   0 equ;  31 neg)
%            Maximal clause size   :    5 (   2 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   2 con; 0-2 aty)
%            Number of variables   :   42 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(p6_23,negated_conjecture,
    ( p6(X1,X2)
    | ~ p6(X3,X1)
    | ~ p6(X3,X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p6_23) ).

cnf(p6_33,negated_conjecture,
    ( p6(f9(X1,X2),f9(X3,X4))
    | ~ p6(X2,X4)
    | ~ p6(X1,X3) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p6_33) ).

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

cnf(p6_36,negated_conjecture,
    ( p6(f8(f10(X1,X2)),f9(f8(X1),f8(X2)))
    | ~ p15(X1)
    | ~ p15(X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p6_36) ).

cnf(not_p6_28,negated_conjecture,
    ~ p6(f8(f10(f3(c19),f3(c18))),f9(f8(c19),f8(c18))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_p6_28) ).

cnf(p6_14,negated_conjecture,
    p6(f8(f3(c18)),f8(c18)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p6_14) ).

cnf(p6_9,negated_conjecture,
    p6(f8(f3(c19)),f8(c19)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p6_9) ).

cnf(f3_is_p15_2,negated_conjecture,
    p15(f3(c18)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',f3_is_p15_2) ).

cnf(f3_is_p15_1,negated_conjecture,
    p15(f3(c19)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',f3_is_p15_1) ).

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

cnf(c_0_10,negated_conjecture,
    ( p6(f9(X1,X2),f9(X3,X4))
    | ~ p6(X2,X4)
    | ~ p6(X1,X3) ),
    inference(fof_simplification,[status(thm)],[p6_33]) ).

cnf(c_0_11,negated_conjecture,
    ( p6(X1,X2)
    | ~ p6(X3,X1)
    | ~ p6(X3,X2) ),
    c_0_9 ).

cnf(c_0_12,negated_conjecture,
    p6(X1,X1),
    p6_4 ).

cnf(c_0_13,negated_conjecture,
    ( p6(f8(f10(X1,X2)),f9(f8(X1),f8(X2)))
    | ~ p15(X1)
    | ~ p15(X2) ),
    inference(fof_simplification,[status(thm)],[p6_36]) ).

cnf(c_0_14,negated_conjecture,
    ( p6(f9(X1,X2),f9(X3,X4))
    | ~ p6(X2,X4)
    | ~ p6(X1,X3) ),
    c_0_10 ).

cnf(c_0_15,negated_conjecture,
    ( p6(X1,X2)
    | ~ p6(X2,X1) ),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_16,negated_conjecture,
    ( p6(f8(f10(X1,X2)),f9(f8(X1),f8(X2)))
    | ~ p15(X1)
    | ~ p15(X2) ),
    c_0_13 ).

cnf(c_0_17,negated_conjecture,
    ~ p6(f8(f10(f3(c19),f3(c18))),f9(f8(c19),f8(c18))),
    inference(fof_simplification,[status(thm)],[not_p6_28]) ).

cnf(c_0_18,negated_conjecture,
    ( p6(X1,f9(X2,X3))
    | ~ p6(f9(X4,X5),X1)
    | ~ p6(X5,X3)
    | ~ p6(X4,X2) ),
    inference(spm,[status(thm)],[c_0_11,c_0_14]) ).

cnf(c_0_19,negated_conjecture,
    ( p6(f9(f8(X1),f8(X2)),f8(f10(X1,X2)))
    | ~ p15(X2)
    | ~ p15(X1) ),
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

cnf(c_0_20,negated_conjecture,
    ~ p6(f8(f10(f3(c19),f3(c18))),f9(f8(c19),f8(c18))),
    c_0_17 ).

cnf(c_0_21,negated_conjecture,
    ( p6(f8(f10(X1,X2)),f9(X3,X4))
    | ~ p6(f8(X2),X4)
    | ~ p6(f8(X1),X3)
    | ~ p15(X2)
    | ~ p15(X1) ),
    inference(spm,[status(thm)],[c_0_18,c_0_19]) ).

cnf(c_0_22,negated_conjecture,
    p6(f8(f3(c18)),f8(c18)),
    p6_14 ).

cnf(c_0_23,negated_conjecture,
    p6(f8(f3(c19)),f8(c19)),
    p6_9 ).

cnf(c_0_24,negated_conjecture,
    p15(f3(c18)),
    f3_is_p15_2 ).

cnf(c_0_25,negated_conjecture,
    p15(f3(c19)),
    f3_is_p15_1 ).

cnf(c_0_26,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]),c_0_23]),c_0_24]),c_0_25])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10  % Problem    : SYN642-1 : TPTP v8.2.0. Released v2.5.0.
% 0.05/0.10  % Command    : run_E %s %d THM
% 0.09/0.30  % Computer : n012.cluster.edu
% 0.09/0.30  % Model    : x86_64 x86_64
% 0.09/0.30  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30  % Memory   : 8042.1875MB
% 0.09/0.30  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30  % CPULimit   : 300
% 0.09/0.30  % WCLimit    : 300
% 0.09/0.30  % DateTime   : Mon May 20 14:44:37 EDT 2024
% 0.09/0.30  % CPUTime    : 
% 0.13/0.39  Running first-order theorem proving
% 0.13/0.39  Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.13/0.53  # Version: 3.1.0
% 0.13/0.53  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.53  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.53  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.53  # Starting new_bool_3 with 300s (1) cores
% 0.13/0.53  # Starting new_bool_1 with 300s (1) cores
% 0.13/0.53  # Starting sh5l with 300s (1) cores
% 0.13/0.53  # new_bool_1 with pid 19703 completed with status 0
% 0.13/0.53  # Result found by new_bool_1
% 0.13/0.53  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.53  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.53  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.53  # Starting new_bool_3 with 300s (1) cores
% 0.13/0.53  # Starting new_bool_1 with 300s (1) cores
% 0.13/0.53  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.13/0.53  # Search class: FGUNM-FFMM21-MFFFFFNN
% 0.13/0.53  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.13/0.53  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.13/0.53  # SAT001_MinMin_p005000_rr_RG with pid 19711 completed with status 0
% 0.13/0.53  # Result found by SAT001_MinMin_p005000_rr_RG
% 0.13/0.53  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.53  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.53  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.53  # Starting new_bool_3 with 300s (1) cores
% 0.13/0.53  # Starting new_bool_1 with 300s (1) cores
% 0.13/0.53  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.13/0.53  # Search class: FGUNM-FFMM21-MFFFFFNN
% 0.13/0.53  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.13/0.53  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.13/0.53  # Preprocessing time       : 0.001 s
% 0.13/0.53  # Presaturation interreduction done
% 0.13/0.53  
% 0.13/0.53  # Proof found!
% 0.13/0.53  # SZS status Unsatisfiable
% 0.13/0.53  # SZS output start CNFRefutation
% See solution above
% 0.13/0.53  # Parsed axioms                        : 42
% 0.13/0.53  # Removed by relevancy pruning/SinE    : 0
% 0.13/0.53  # Initial clauses                      : 42
% 0.13/0.53  # Removed in clause preprocessing      : 0
% 0.13/0.53  # Initial clauses in saturation        : 42
% 0.13/0.53  # Processed clauses                    : 2470
% 0.13/0.53  # ...of these trivial                  : 0
% 0.13/0.53  # ...subsumed                          : 1536
% 0.13/0.53  # ...remaining for further processing  : 934
% 0.13/0.53  # Other redundant clauses eliminated   : 0
% 0.13/0.53  # Clauses deleted for lack of memory   : 0
% 0.13/0.53  # Backward-subsumed                    : 54
% 0.13/0.53  # Backward-rewritten                   : 0
% 0.13/0.53  # Generated clauses                    : 10109
% 0.13/0.53  # ...of the previous two non-redundant : 8858
% 0.13/0.53  # ...aggressively subsumed             : 0
% 0.13/0.53  # Contextual simplify-reflections      : 0
% 0.13/0.53  # Paramodulations                      : 10109
% 0.13/0.53  # Factorizations                       : 0
% 0.13/0.53  # NegExts                              : 0
% 0.13/0.53  # Equation resolutions                 : 0
% 0.13/0.53  # Disequality decompositions           : 0
% 0.13/0.53  # Total rewrite steps                  : 2118
% 0.13/0.53  # ...of those cached                   : 2081
% 0.13/0.53  # Propositional unsat checks           : 0
% 0.13/0.53  #    Propositional check models        : 0
% 0.13/0.53  #    Propositional check unsatisfiable : 0
% 0.13/0.53  #    Propositional clauses             : 0
% 0.13/0.53  #    Propositional clauses after purity: 0
% 0.13/0.53  #    Propositional unsat core size     : 0
% 0.13/0.53  #    Propositional preprocessing time  : 0.000
% 0.13/0.53  #    Propositional encoding time       : 0.000
% 0.13/0.53  #    Propositional solver time         : 0.000
% 0.13/0.53  #    Success case prop preproc time    : 0.000
% 0.13/0.53  #    Success case prop encoding time   : 0.000
% 0.13/0.53  #    Success case prop solver time     : 0.000
% 0.13/0.53  # Current number of processed clauses  : 838
% 0.13/0.53  #    Positive orientable unit clauses  : 20
% 0.13/0.53  #    Positive unorientable unit clauses: 0
% 0.13/0.53  #    Negative unit clauses             : 1
% 0.13/0.53  #    Non-unit-clauses                  : 817
% 0.13/0.53  # Current number of unprocessed clauses: 6390
% 0.13/0.53  # ...number of literals in the above   : 22556
% 0.13/0.53  # Current number of archived formulas  : 0
% 0.13/0.53  # Current number of archived clauses   : 96
% 0.13/0.53  # Clause-clause subsumption calls (NU) : 85632
% 0.13/0.53  # Rec. Clause-clause subsumption calls : 79348
% 0.13/0.53  # Non-unit clause-clause subsumptions  : 1590
% 0.13/0.53  # Unit Clause-clause subsumption calls : 0
% 0.13/0.53  # Rewrite failures with RHS unbound    : 0
% 0.13/0.53  # BW rewrite match attempts            : 3
% 0.13/0.53  # BW rewrite match successes           : 0
% 0.13/0.53  # Condensation attempts                : 0
% 0.13/0.53  # Condensation successes               : 0
% 0.13/0.53  # Termbank termtop insertions          : 139861
% 0.13/0.53  # Search garbage collected termcells   : 115
% 0.13/0.53  
% 0.13/0.53  # -------------------------------------------------
% 0.13/0.53  # User time                : 0.127 s
% 0.13/0.53  # System time              : 0.003 s
% 0.13/0.53  # Total time               : 0.130 s
% 0.13/0.53  # Maximum resident set size: 1728 pages
% 0.13/0.53  
% 0.13/0.53  # -------------------------------------------------
% 0.13/0.53  # User time                : 0.127 s
% 0.13/0.53  # System time              : 0.006 s
% 0.13/0.53  # Total time               : 0.133 s
% 0.13/0.53  # Maximum resident set size: 1752 pages
% 0.13/0.53  % E---3.1 exiting
% 0.13/0.53  % E exiting
%------------------------------------------------------------------------------