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

View Problem - Process Solution

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

% Computer : n014.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:21 EDT 2024

% Result   : Unsatisfiable 1.15s 0.60s
% Output   : CNFRefutation 1.15s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    8
% Syntax   : Number of clauses     :   26 (  14 unt;   0 nHn;  22 RR)
%            Number of literals    :   45 (   0 equ;  23 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    6 (   2 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    9 (   9 usr;   4 con; 0-2 aty)
%            Number of variables   :   38 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(p2_42,negated_conjecture,
    ( p2(X1,X2)
    | ~ p2(X3,X1)
    | ~ p2(X3,X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p2_42) ).

cnf(p2_12,negated_conjecture,
    p2(X1,X1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p2_12) ).

cnf(p2_55,negated_conjecture,
    p2(f11(f4(f23(c44,f9(f20(c37)))),c43),f11(f4(c44),c43)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p2_55) ).

cnf(not_p2_56,negated_conjecture,
    ~ p2(f11(f4(c45),c43),f11(f4(f23(c44,f9(f20(c37)))),c43)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not_p2_56) ).

cnf(p2_61,negated_conjecture,
    ( p2(f11(X1,X2),f11(X3,X4))
    | ~ p10(X2,X4)
    | ~ p3(X1,X3) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p2_61) ).

cnf(p3_36,negated_conjecture,
    ( p3(f4(X1),f4(X2))
    | ~ p2(X1,X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p3_36) ).

cnf(p2_16,negated_conjecture,
    p2(c44,c45),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p2_16) ).

cnf(p10_7,negated_conjecture,
    p10(X1,X1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p10_7) ).

cnf(c_0_8,negated_conjecture,
    ( p2(X1,X2)
    | ~ p2(X3,X1)
    | ~ p2(X3,X2) ),
    inference(fof_simplification,[status(thm)],[p2_42]) ).

cnf(c_0_9,negated_conjecture,
    ( p2(X1,X2)
    | ~ p2(X3,X1)
    | ~ p2(X3,X2) ),
    c_0_8 ).

cnf(c_0_10,negated_conjecture,
    p2(X1,X1),
    p2_12 ).

cnf(c_0_11,negated_conjecture,
    ( p2(X1,X2)
    | ~ p2(X2,X1) ),
    inference(spm,[status(thm)],[c_0_9,c_0_10]) ).

cnf(c_0_12,negated_conjecture,
    p2(f11(f4(f23(c44,f9(f20(c37)))),c43),f11(f4(c44),c43)),
    p2_55 ).

cnf(c_0_13,negated_conjecture,
    ~ p2(f11(f4(c45),c43),f11(f4(f23(c44,f9(f20(c37)))),c43)),
    inference(fof_simplification,[status(thm)],[not_p2_56]) ).

cnf(c_0_14,negated_conjecture,
    p2(f11(f4(c44),c43),f11(f4(f23(c44,f9(f20(c37)))),c43)),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_15,negated_conjecture,
    ( p2(f11(X1,X2),f11(X3,X4))
    | ~ p10(X2,X4)
    | ~ p3(X1,X3) ),
    inference(fof_simplification,[status(thm)],[p2_61]) ).

cnf(c_0_16,negated_conjecture,
    ( p3(f4(X1),f4(X2))
    | ~ p2(X1,X2) ),
    inference(fof_simplification,[status(thm)],[p3_36]) ).

cnf(c_0_17,negated_conjecture,
    ~ p2(f11(f4(c45),c43),f11(f4(f23(c44,f9(f20(c37)))),c43)),
    c_0_13 ).

cnf(c_0_18,negated_conjecture,
    ( p2(X1,f11(f4(f23(c44,f9(f20(c37)))),c43))
    | ~ p2(f11(f4(c44),c43),X1) ),
    inference(spm,[status(thm)],[c_0_9,c_0_14]) ).

cnf(c_0_19,negated_conjecture,
    ( p2(f11(X1,X2),f11(X3,X4))
    | ~ p10(X2,X4)
    | ~ p3(X1,X3) ),
    c_0_15 ).

cnf(c_0_20,negated_conjecture,
    ( p3(f4(X1),f4(X2))
    | ~ p2(X1,X2) ),
    c_0_16 ).

cnf(c_0_21,negated_conjecture,
    ~ p2(f11(f4(c44),c43),f11(f4(c45),c43)),
    inference(spm,[status(thm)],[c_0_17,c_0_18]) ).

cnf(c_0_22,negated_conjecture,
    ( p2(f11(f4(X1),X2),f11(f4(X3),X4))
    | ~ p2(X1,X3)
    | ~ p10(X2,X4) ),
    inference(spm,[status(thm)],[c_0_19,c_0_20]) ).

cnf(c_0_23,negated_conjecture,
    p2(c44,c45),
    p2_16 ).

cnf(c_0_24,negated_conjecture,
    p10(X1,X1),
    p10_7 ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : SYN696-1 : TPTP v8.2.0. Released v2.5.0.
% 0.12/0.13  % Command    : run_E %s %d THM
% 0.12/0.34  % Computer : n014.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit   : 300
% 0.12/0.34  % WCLimit    : 300
% 0.12/0.34  % DateTime   : Mon May 20 15:53:07 EDT 2024
% 0.12/0.34  % CPUTime    : 
% 0.21/0.47  Running first-order theorem proving
% 0.21/0.47  Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 1.15/0.60  # Version: 3.1.0
% 1.15/0.60  # Preprocessing class: FSLSSMSMSSSNFFN.
% 1.15/0.60  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.15/0.60  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.15/0.60  # Starting new_bool_3 with 300s (1) cores
% 1.15/0.60  # Starting new_bool_1 with 300s (1) cores
% 1.15/0.60  # Starting sh5l with 300s (1) cores
% 1.15/0.60  # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 6764 completed with status 0
% 1.15/0.60  # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 1.15/0.60  # Preprocessing class: FSLSSMSMSSSNFFN.
% 1.15/0.60  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.15/0.60  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.15/0.60  # No SInE strategy applied
% 1.15/0.60  # Search class: FGHNM-FFMM21-MFFFFFNN
% 1.15/0.60  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1.15/0.60  # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 1.15/0.60  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 1.15/0.60  # Starting new_bool_3 with 136s (1) cores
% 1.15/0.60  # Starting new_bool_1 with 136s (1) cores
% 1.15/0.60  # Starting sh5l with 136s (1) cores
% 1.15/0.60  # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 6769 completed with status 0
% 1.15/0.60  # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 1.15/0.60  # Preprocessing class: FSLSSMSMSSSNFFN.
% 1.15/0.60  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.15/0.60  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.15/0.60  # No SInE strategy applied
% 1.15/0.60  # Search class: FGHNM-FFMM21-MFFFFFNN
% 1.15/0.60  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1.15/0.60  # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 1.15/0.60  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 1.15/0.60  # Preprocessing time       : 0.002 s
% 1.15/0.60  # Presaturation interreduction done
% 1.15/0.60  
% 1.15/0.60  # Proof found!
% 1.15/0.60  # SZS status Unsatisfiable
% 1.15/0.60  # SZS output start CNFRefutation
% See solution above
% 1.15/0.60  # Parsed axioms                        : 73
% 1.15/0.60  # Removed by relevancy pruning/SinE    : 0
% 1.15/0.60  # Initial clauses                      : 73
% 1.15/0.60  # Removed in clause preprocessing      : 0
% 1.15/0.60  # Initial clauses in saturation        : 73
% 1.15/0.60  # Processed clauses                    : 1031
% 1.15/0.60  # ...of these trivial                  : 0
% 1.15/0.60  # ...subsumed                          : 294
% 1.15/0.60  # ...remaining for further processing  : 737
% 1.15/0.60  # Other redundant clauses eliminated   : 0
% 1.15/0.60  # Clauses deleted for lack of memory   : 0
% 1.15/0.60  # Backward-subsumed                    : 26
% 1.15/0.60  # Backward-rewritten                   : 0
% 1.15/0.60  # Generated clauses                    : 2859
% 1.15/0.60  # ...of the previous two non-redundant : 2725
% 1.15/0.60  # ...aggressively subsumed             : 0
% 1.15/0.60  # Contextual simplify-reflections      : 4
% 1.15/0.60  # Paramodulations                      : 2859
% 1.15/0.60  # Factorizations                       : 0
% 1.15/0.60  # NegExts                              : 0
% 1.15/0.60  # Equation resolutions                 : 0
% 1.15/0.60  # Disequality decompositions           : 0
% 1.15/0.60  # Total rewrite steps                  : 203
% 1.15/0.60  # ...of those cached                   : 166
% 1.15/0.60  # Propositional unsat checks           : 0
% 1.15/0.60  #    Propositional check models        : 0
% 1.15/0.60  #    Propositional check unsatisfiable : 0
% 1.15/0.60  #    Propositional clauses             : 0
% 1.15/0.60  #    Propositional clauses after purity: 0
% 1.15/0.60  #    Propositional unsat core size     : 0
% 1.15/0.60  #    Propositional preprocessing time  : 0.000
% 1.15/0.60  #    Propositional encoding time       : 0.000
% 1.15/0.60  #    Propositional solver time         : 0.000
% 1.15/0.60  #    Success case prop preproc time    : 0.000
% 1.15/0.60  #    Success case prop encoding time   : 0.000
% 1.15/0.60  #    Success case prop solver time     : 0.000
% 1.15/0.60  # Current number of processed clauses  : 638
% 1.15/0.60  #    Positive orientable unit clauses  : 37
% 1.15/0.60  #    Positive unorientable unit clauses: 0
% 1.15/0.60  #    Negative unit clauses             : 8
% 1.15/0.60  #    Non-unit-clauses                  : 593
% 1.15/0.60  # Current number of unprocessed clauses: 1826
% 1.15/0.60  # ...number of literals in the above   : 6244
% 1.15/0.60  # Current number of archived formulas  : 0
% 1.15/0.60  # Current number of archived clauses   : 99
% 1.15/0.60  # Clause-clause subsumption calls (NU) : 62216
% 1.15/0.60  # Rec. Clause-clause subsumption calls : 51927
% 1.15/0.60  # Non-unit clause-clause subsumptions  : 316
% 1.15/0.60  # Unit Clause-clause subsumption calls : 348
% 1.15/0.60  # Rewrite failures with RHS unbound    : 0
% 1.15/0.60  # BW rewrite match attempts            : 9
% 1.15/0.60  # BW rewrite match successes           : 0
% 1.15/0.60  # Condensation attempts                : 0
% 1.15/0.60  # Condensation successes               : 0
% 1.15/0.60  # Termbank termtop insertions          : 41390
% 1.15/0.60  # Search garbage collected termcells   : 200
% 1.15/0.60  
% 1.15/0.60  # -------------------------------------------------
% 1.15/0.60  # User time                : 0.093 s
% 1.15/0.60  # System time              : 0.007 s
% 1.15/0.60  # Total time               : 0.100 s
% 1.15/0.60  # Maximum resident set size: 1776 pages
% 1.15/0.60  
% 1.15/0.60  # -------------------------------------------------
% 1.15/0.60  # User time                : 0.459 s
% 1.15/0.60  # System time              : 0.017 s
% 1.15/0.60  # Total time               : 0.476 s
% 1.15/0.60  # Maximum resident set size: 1764 pages
% 1.15/0.60  % E---3.1 exiting
% 1.15/0.60  % E exiting
%------------------------------------------------------------------------------