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

View Problem - Process Solution

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

% Computer : n004.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:19 EDT 2023

% Result   : Unsatisfiable 0.20s 0.56s
% Output   : CNFRefutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    8
% Syntax   : Number of clauses     :   25 (   8 unt;   0 nHn;  17 RR)
%            Number of literals    :   46 (   0 equ;  23 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    5 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :   20 (  20 usr;  12 con; 0-8 aty)
%            Number of variables   :  123 (  36 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(p12_24,negated_conjecture,
    ( p12(X1,X2)
    | ~ p12(X3,X1)
    | ~ p12(X3,X2) ),
    file('/export/starexec/sandbox2/tmp/tmp.2smn8QIgc1/E---3.1_25201.p',p12_24) ).

cnf(p12_9,negated_conjecture,
    p12(X1,X1),
    file('/export/starexec/sandbox2/tmp/tmp.2smn8QIgc1/E---3.1_25201.p',p12_9) ).

cnf(p12_37,negated_conjecture,
    ( p12(f13(X1),f13(f17(X2,X3,X4,X5,X6,X1,X7,X8)))
    | ~ p21(f11(X3,X4,X1,X7,X8,X5),X6) ),
    file('/export/starexec/sandbox2/tmp/tmp.2smn8QIgc1/E---3.1_25201.p',p12_37) ).

cnf(p12_13,negated_conjecture,
    ( p12(f13(X1),f13(X2))
    | ~ p7(X1,X2) ),
    file('/export/starexec/sandbox2/tmp/tmp.2smn8QIgc1/E---3.1_25201.p',p12_13) ).

cnf(p7_32,negated_conjecture,
    ( p7(X1,X2)
    | ~ p3(f11(X3,X4,X1,X5,X6,X7),f11(X8,X9,X2,X10,X11,X12)) ),
    file('/export/starexec/sandbox2/tmp/tmp.2smn8QIgc1/E---3.1_25201.p',p7_32) ).

cnf(p3_48,negated_conjecture,
    ( p3(X1,f11(f19(X2,X3,X4,X5,X1,X6,X7,X8),f18(X2,X3,X4,X5,X1,X6,X7,X8),f17(X2,X3,X4,X5,X1,X6,X7,X8),f16(X2,X3,X4,X5,X1,X6,X7,X8),f15(X2,X3,X4,X5,X1,X6,X7,X8),f14(X2,X3,X4,X5,X1,X6,X7,X8)))
    | ~ p21(f11(X3,X4,X6,X7,X8,X5),X1) ),
    file('/export/starexec/sandbox2/tmp/tmp.2smn8QIgc1/E---3.1_25201.p',p3_48) ).

cnf(p21_27,negated_conjecture,
    p21(f11(c24,c25,c22,c26,c27,c28),f11(c29,c30,c23,c31,c32,c33)),
    file('/export/starexec/sandbox2/tmp/tmp.2smn8QIgc1/E---3.1_25201.p',p21_27) ).

cnf(not_p12_10,negated_conjecture,
    ~ p12(f13(c22),f13(c23)),
    file('/export/starexec/sandbox2/tmp/tmp.2smn8QIgc1/E---3.1_25201.p',not_p12_10) ).

cnf(c_0_8,negated_conjecture,
    ( p12(X1,X2)
    | ~ p12(X3,X1)
    | ~ p12(X3,X2) ),
    p12_24 ).

cnf(c_0_9,negated_conjecture,
    p12(X1,X1),
    p12_9 ).

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

cnf(c_0_11,negated_conjecture,
    ( p12(f13(X1),f13(f17(X2,X3,X4,X5,X6,X1,X7,X8)))
    | ~ p21(f11(X3,X4,X1,X7,X8,X5),X6) ),
    p12_37 ).

cnf(c_0_12,negated_conjecture,
    ( p12(f13(f17(X1,X2,X3,X4,X5,X6,X7,X8)),f13(X6))
    | ~ p21(f11(X2,X3,X6,X7,X8,X4),X5) ),
    inference(spm,[status(thm)],[c_0_10,c_0_11]) ).

cnf(c_0_13,negated_conjecture,
    ( p12(f13(X1),f13(X2))
    | ~ p7(X1,X2) ),
    p12_13 ).

cnf(c_0_14,negated_conjecture,
    ( p12(X1,f13(X2))
    | ~ p21(f11(X3,X4,X2,X5,X6,X7),X8)
    | ~ p12(f13(f17(X9,X3,X4,X7,X8,X2,X5,X6)),X1) ),
    inference(spm,[status(thm)],[c_0_8,c_0_12]) ).

cnf(c_0_15,negated_conjecture,
    ( p12(f13(X1),f13(X2))
    | ~ p7(X2,X1) ),
    inference(spm,[status(thm)],[c_0_10,c_0_13]) ).

cnf(c_0_16,negated_conjecture,
    ( p7(X1,X2)
    | ~ p3(f11(X3,X4,X1,X5,X6,X7),f11(X8,X9,X2,X10,X11,X12)) ),
    p7_32 ).

cnf(c_0_17,negated_conjecture,
    ( p3(X1,f11(f19(X2,X3,X4,X5,X1,X6,X7,X8),f18(X2,X3,X4,X5,X1,X6,X7,X8),f17(X2,X3,X4,X5,X1,X6,X7,X8),f16(X2,X3,X4,X5,X1,X6,X7,X8),f15(X2,X3,X4,X5,X1,X6,X7,X8),f14(X2,X3,X4,X5,X1,X6,X7,X8)))
    | ~ p21(f11(X3,X4,X6,X7,X8,X5),X1) ),
    p3_48 ).

cnf(c_0_18,negated_conjecture,
    ( p12(f13(X1),f13(X2))
    | ~ p21(f11(X3,X4,X2,X5,X6,X7),X8)
    | ~ p7(X1,f17(X9,X3,X4,X7,X8,X2,X5,X6)) ),
    inference(spm,[status(thm)],[c_0_14,c_0_15]) ).

cnf(c_0_19,negated_conjecture,
    ( p7(X1,f17(X2,X3,X4,X5,f11(X6,X7,X1,X8,X9,X10),X11,X12,X13))
    | ~ p21(f11(X3,X4,X11,X12,X13,X5),f11(X6,X7,X1,X8,X9,X10)) ),
    inference(spm,[status(thm)],[c_0_16,c_0_17]) ).

cnf(c_0_20,negated_conjecture,
    ( p12(f13(X1),f13(X2))
    | ~ p21(f11(X3,X4,X2,X5,X6,X7),f11(X8,X9,X1,X10,X11,X12)) ),
    inference(spm,[status(thm)],[c_0_18,c_0_19]) ).

cnf(c_0_21,negated_conjecture,
    p21(f11(c24,c25,c22,c26,c27,c28),f11(c29,c30,c23,c31,c32,c33)),
    p21_27 ).

cnf(c_0_22,negated_conjecture,
    p12(f13(c23),f13(c22)),
    inference(spm,[status(thm)],[c_0_20,c_0_21]) ).

cnf(c_0_23,negated_conjecture,
    ~ p12(f13(c22),f13(c23)),
    not_p12_10 ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem    : SYN653-1 : TPTP v8.1.2. Released v2.5.0.
% 0.13/0.14  % Command    : run_E %s %d THM
% 0.13/0.35  % Computer : n004.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   : 2400
% 0.13/0.35  % WCLimit    : 300
% 0.13/0.35  % DateTime   : Mon Oct  2 18:22:30 EDT 2023
% 0.13/0.35  % CPUTime    : 
% 0.20/0.49  Running first-order model finding
% 0.20/0.49  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/tmp/tmp.2smn8QIgc1/E---3.1_25201.p
% 0.20/0.56  # Version: 3.1pre001
% 0.20/0.56  # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.56  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.56  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.56  # Starting new_bool_3 with 300s (1) cores
% 0.20/0.56  # Starting new_bool_1 with 300s (1) cores
% 0.20/0.56  # Starting sh5l with 300s (1) cores
% 0.20/0.56  # new_bool_1 with pid 25294 completed with status 0
% 0.20/0.56  # Result found by new_bool_1
% 0.20/0.56  # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.56  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.56  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.56  # Starting new_bool_3 with 300s (1) cores
% 0.20/0.56  # Starting new_bool_1 with 300s (1) cores
% 0.20/0.56  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.56  # Search class: FHUNM-FFMF33-SFFFFFNN
% 0.20/0.56  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.56  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.56  # SAT001_MinMin_p005000_rr_RG with pid 25300 completed with status 0
% 0.20/0.56  # Result found by SAT001_MinMin_p005000_rr_RG
% 0.20/0.56  # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.56  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.56  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.56  # Starting new_bool_3 with 300s (1) cores
% 0.20/0.56  # Starting new_bool_1 with 300s (1) cores
% 0.20/0.56  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.56  # Search class: FHUNM-FFMF33-SFFFFFNN
% 0.20/0.56  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.56  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.56  # Preprocessing time       : 0.002 s
% 0.20/0.56  # Presaturation interreduction done
% 0.20/0.56  
% 0.20/0.56  # Proof found!
% 0.20/0.56  # SZS status Unsatisfiable
% 0.20/0.56  # SZS output start CNFRefutation
% See solution above
% 0.20/0.56  # Parsed axioms                        : 48
% 0.20/0.56  # Removed by relevancy pruning/SinE    : 0
% 0.20/0.56  # Initial clauses                      : 48
% 0.20/0.56  # Removed in clause preprocessing      : 0
% 0.20/0.56  # Initial clauses in saturation        : 48
% 0.20/0.56  # Processed clauses                    : 548
% 0.20/0.56  # ...of these trivial                  : 4
% 0.20/0.56  # ...subsumed                          : 255
% 0.20/0.56  # ...remaining for further processing  : 289
% 0.20/0.56  # Other redundant clauses eliminated   : 0
% 0.20/0.56  # Clauses deleted for lack of memory   : 0
% 0.20/0.56  # Backward-subsumed                    : 10
% 0.20/0.56  # Backward-rewritten                   : 0
% 0.20/0.56  # Generated clauses                    : 1348
% 0.20/0.56  # ...of the previous two non-redundant : 1204
% 0.20/0.56  # ...aggressively subsumed             : 0
% 0.20/0.56  # Contextual simplify-reflections      : 6
% 0.20/0.56  # Paramodulations                      : 1348
% 0.20/0.56  # Factorizations                       : 0
% 0.20/0.56  # NegExts                              : 0
% 0.20/0.56  # Equation resolutions                 : 0
% 0.20/0.56  # Total rewrite steps                  : 203
% 0.20/0.56  # Propositional unsat checks           : 0
% 0.20/0.56  #    Propositional check models        : 0
% 0.20/0.56  #    Propositional check unsatisfiable : 0
% 0.20/0.56  #    Propositional clauses             : 0
% 0.20/0.56  #    Propositional clauses after purity: 0
% 0.20/0.56  #    Propositional unsat core size     : 0
% 0.20/0.56  #    Propositional preprocessing time  : 0.000
% 0.20/0.56  #    Propositional encoding time       : 0.000
% 0.20/0.56  #    Propositional solver time         : 0.000
% 0.20/0.56  #    Success case prop preproc time    : 0.000
% 0.20/0.56  #    Success case prop encoding time   : 0.000
% 0.20/0.56  #    Success case prop solver time     : 0.000
% 0.20/0.56  # Current number of processed clauses  : 233
% 0.20/0.56  #    Positive orientable unit clauses  : 16
% 0.20/0.56  #    Positive unorientable unit clauses: 0
% 0.20/0.56  #    Negative unit clauses             : 7
% 0.20/0.56  #    Non-unit-clauses                  : 210
% 0.20/0.56  # Current number of unprocessed clauses: 743
% 0.20/0.56  # ...number of literals in the above   : 3643
% 0.20/0.56  # Current number of archived formulas  : 0
% 0.20/0.56  # Current number of archived clauses   : 56
% 0.20/0.56  # Clause-clause subsumption calls (NU) : 13028
% 0.20/0.56  # Rec. Clause-clause subsumption calls : 6598
% 0.20/0.56  # Non-unit clause-clause subsumptions  : 255
% 0.20/0.56  # Unit Clause-clause subsumption calls : 35
% 0.20/0.56  # Rewrite failures with RHS unbound    : 0
% 0.20/0.56  # BW rewrite match attempts            : 5
% 0.20/0.56  # BW rewrite match successes           : 0
% 0.20/0.56  # Condensation attempts                : 0
% 0.20/0.56  # Condensation successes               : 0
% 0.20/0.56  # Termbank termtop insertions          : 21891
% 0.20/0.56  
% 0.20/0.56  # -------------------------------------------------
% 0.20/0.56  # User time                : 0.057 s
% 0.20/0.56  # System time              : 0.003 s
% 0.20/0.56  # Total time               : 0.060 s
% 0.20/0.56  # Maximum resident set size: 1828 pages
% 0.20/0.56  
% 0.20/0.56  # -------------------------------------------------
% 0.20/0.56  # User time                : 0.059 s
% 0.20/0.56  # System time              : 0.005 s
% 0.20/0.56  # Total time               : 0.064 s
% 0.20/0.56  # Maximum resident set size: 1748 pages
% 0.20/0.56  % E---3.1 exiting
%------------------------------------------------------------------------------