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

View Problem - Process Solution

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

% Computer : n019.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:13 EDT 2023

% Result   : Unsatisfiable 12.52s 2.05s
% Output   : CNFRefutation 12.52s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    9
% Syntax   : Number of clauses     :   25 (  13 unt;   0 nHn;  21 RR)
%            Number of literals    :   49 (   0 equ;  27 neg)
%            Maximal clause size   :    4 (   1 avg)
%            Maximal term depth    :    7 (   2 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :   11 (  11 usr;   3 con; 0-2 aty)
%            Number of variables   :   42 (   3 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(p17_20,negated_conjecture,
    ( p17(X1,X2)
    | ~ p2(X3,X1)
    | ~ p2(X4,X2)
    | ~ p17(X3,X4) ),
    file('/export/starexec/sandbox/tmp/tmp.lyIclMyWIF/E---3.1_22500.p',p17_20) ).

cnf(p17_29,negated_conjecture,
    p17(f9(f10(f14(f4(f9(c19)),c19),f4(f6(f7(f8(c20)))))),f6(f7(f8(c20)))),
    file('/export/starexec/sandbox/tmp/tmp.lyIclMyWIF/E---3.1_22500.p',p17_29) ).

cnf(p2_12,negated_conjecture,
    ( p2(f9(X1),f9(X2))
    | ~ p3(X1,X2) ),
    file('/export/starexec/sandbox/tmp/tmp.lyIclMyWIF/E---3.1_22500.p',p2_12) ).

cnf(p3_19,negated_conjecture,
    ( p3(X1,X2)
    | ~ p3(X3,X1)
    | ~ p3(X3,X2) ),
    file('/export/starexec/sandbox/tmp/tmp.lyIclMyWIF/E---3.1_22500.p',p3_19) ).

cnf(p3_4,negated_conjecture,
    p3(X1,X1),
    file('/export/starexec/sandbox/tmp/tmp.lyIclMyWIF/E---3.1_22500.p',p3_4) ).

cnf(p3_24,negated_conjecture,
    ( p3(f10(X1,X2),f10(X3,X4))
    | ~ p3(X1,X3)
    | ~ p3(X2,X4) ),
    file('/export/starexec/sandbox/tmp/tmp.lyIclMyWIF/E---3.1_22500.p',p3_24) ).

cnf(p3_22,negated_conjecture,
    p3(f12(f4(f6(f7(f8(c20)))),c21),f4(f6(f7(f8(c20))))),
    file('/export/starexec/sandbox/tmp/tmp.lyIclMyWIF/E---3.1_22500.p',p3_22) ).

cnf(not_p17_28,negated_conjecture,
    ~ p17(f9(f10(f14(f4(f9(c19)),c19),f12(X1,c21))),f6(f7(f8(c20)))),
    file('/export/starexec/sandbox/tmp/tmp.lyIclMyWIF/E---3.1_22500.p',not_p17_28) ).

cnf(p2_2,negated_conjecture,
    p2(X1,X1),
    file('/export/starexec/sandbox/tmp/tmp.lyIclMyWIF/E---3.1_22500.p',p2_2) ).

cnf(c_0_9,negated_conjecture,
    ( p17(X1,X2)
    | ~ p2(X3,X1)
    | ~ p2(X4,X2)
    | ~ p17(X3,X4) ),
    p17_20 ).

cnf(c_0_10,negated_conjecture,
    p17(f9(f10(f14(f4(f9(c19)),c19),f4(f6(f7(f8(c20)))))),f6(f7(f8(c20)))),
    p17_29 ).

cnf(c_0_11,negated_conjecture,
    ( p17(X1,X2)
    | ~ p2(f9(f10(f14(f4(f9(c19)),c19),f4(f6(f7(f8(c20)))))),X1)
    | ~ p2(f6(f7(f8(c20))),X2) ),
    inference(spm,[status(thm)],[c_0_9,c_0_10]) ).

cnf(c_0_12,negated_conjecture,
    ( p2(f9(X1),f9(X2))
    | ~ p3(X1,X2) ),
    p2_12 ).

cnf(c_0_13,negated_conjecture,
    ( p3(X1,X2)
    | ~ p3(X3,X1)
    | ~ p3(X3,X2) ),
    p3_19 ).

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

cnf(c_0_15,negated_conjecture,
    ( p17(f9(X1),X2)
    | ~ p3(f10(f14(f4(f9(c19)),c19),f4(f6(f7(f8(c20))))),X1)
    | ~ p2(f6(f7(f8(c20))),X2) ),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_16,negated_conjecture,
    ( p3(f10(X1,X2),f10(X3,X4))
    | ~ p3(X1,X3)
    | ~ p3(X2,X4) ),
    p3_24 ).

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

cnf(c_0_18,negated_conjecture,
    p3(f12(f4(f6(f7(f8(c20)))),c21),f4(f6(f7(f8(c20))))),
    p3_22 ).

cnf(c_0_19,negated_conjecture,
    ~ p17(f9(f10(f14(f4(f9(c19)),c19),f12(X1,c21))),f6(f7(f8(c20)))),
    not_p17_28 ).

cnf(c_0_20,negated_conjecture,
    ( p17(f9(f10(X1,X2)),X3)
    | ~ p3(f4(f6(f7(f8(c20)))),X2)
    | ~ p3(f14(f4(f9(c19)),c19),X1)
    | ~ p2(f6(f7(f8(c20))),X3) ),
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

cnf(c_0_21,negated_conjecture,
    p2(X1,X1),
    p2_2 ).

cnf(c_0_22,negated_conjecture,
    p3(f4(f6(f7(f8(c20)))),f12(f4(f6(f7(f8(c20)))),c21)),
    inference(spm,[status(thm)],[c_0_17,c_0_18]) ).

cnf(c_0_23,negated_conjecture,
    ~ p3(f4(f6(f7(f8(c20)))),f12(X1,c21)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_14]),c_0_21])]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.10  % Problem    : SYN611-1 : TPTP v8.1.2. Released v2.5.0.
% 0.03/0.11  % Command    : run_E %s %d THM
% 0.10/0.30  % Computer : n019.cluster.edu
% 0.10/0.30  % Model    : x86_64 x86_64
% 0.10/0.30  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30  % Memory   : 8042.1875MB
% 0.10/0.30  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30  % CPULimit   : 2400
% 0.10/0.30  % WCLimit    : 300
% 0.10/0.30  % DateTime   : Mon Oct  2 18:19:21 EDT 2023
% 0.10/0.30  % CPUTime    : 
% 0.14/0.43  Running first-order model finding
% 0.14/0.43  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/tmp/tmp.lyIclMyWIF/E---3.1_22500.p
% 12.52/2.05  # Version: 3.1pre001
% 12.52/2.05  # Preprocessing class: FSMSSMSSSSSNFFN.
% 12.52/2.05  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 12.52/2.05  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 12.52/2.05  # Starting new_bool_3 with 300s (1) cores
% 12.52/2.05  # Starting new_bool_1 with 300s (1) cores
% 12.52/2.05  # Starting sh5l with 300s (1) cores
% 12.52/2.05  # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 22577 completed with status 0
% 12.52/2.05  # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 12.52/2.05  # Preprocessing class: FSMSSMSSSSSNFFN.
% 12.52/2.05  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 12.52/2.05  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 12.52/2.05  # No SInE strategy applied
% 12.52/2.05  # Search class: FGUNS-FFMS21-DFFFFFNN
% 12.52/2.05  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 12.52/2.05  # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 12.52/2.05  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 12.52/2.05  # Starting new_bool_3 with 136s (1) cores
% 12.52/2.05  # Starting new_bool_1 with 136s (1) cores
% 12.52/2.05  # Starting sh5l with 136s (1) cores
% 12.52/2.05  # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 22582 completed with status 0
% 12.52/2.05  # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 12.52/2.05  # Preprocessing class: FSMSSMSSSSSNFFN.
% 12.52/2.05  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 12.52/2.05  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 12.52/2.05  # No SInE strategy applied
% 12.52/2.05  # Search class: FGUNS-FFMS21-DFFFFFNN
% 12.52/2.05  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 12.52/2.05  # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 12.52/2.05  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 12.52/2.05  # Preprocessing time       : 0.001 s
% 12.52/2.05  # Presaturation interreduction done
% 12.52/2.05  
% 12.52/2.05  # Proof found!
% 12.52/2.05  # SZS status Unsatisfiable
% 12.52/2.05  # SZS output start CNFRefutation
% See solution above
% 12.52/2.05  # Parsed axioms                        : 30
% 12.52/2.05  # Removed by relevancy pruning/SinE    : 0
% 12.52/2.05  # Initial clauses                      : 30
% 12.52/2.05  # Removed in clause preprocessing      : 0
% 12.52/2.05  # Initial clauses in saturation        : 30
% 12.52/2.05  # Processed clauses                    : 10964
% 12.52/2.05  # ...of these trivial                  : 16
% 12.52/2.05  # ...subsumed                          : 8904
% 12.52/2.05  # ...remaining for further processing  : 2044
% 12.52/2.05  # Other redundant clauses eliminated   : 0
% 12.52/2.05  # Clauses deleted for lack of memory   : 0
% 12.52/2.05  # Backward-subsumed                    : 97
% 12.52/2.05  # Backward-rewritten                   : 0
% 12.52/2.05  # Generated clauses                    : 102861
% 12.52/2.05  # ...of the previous two non-redundant : 97111
% 12.52/2.05  # ...aggressively subsumed             : 0
% 12.52/2.05  # Contextual simplify-reflections      : 12
% 12.52/2.05  # Paramodulations                      : 102860
% 12.52/2.05  # Factorizations                       : 0
% 12.52/2.05  # NegExts                              : 0
% 12.52/2.05  # Equation resolutions                 : 0
% 12.52/2.05  # Total rewrite steps                  : 24466
% 12.52/2.05  # Propositional unsat checks           : 0
% 12.52/2.05  #    Propositional check models        : 0
% 12.52/2.05  #    Propositional check unsatisfiable : 0
% 12.52/2.05  #    Propositional clauses             : 0
% 12.52/2.05  #    Propositional clauses after purity: 0
% 12.52/2.05  #    Propositional unsat core size     : 0
% 12.52/2.05  #    Propositional preprocessing time  : 0.000
% 12.52/2.05  #    Propositional encoding time       : 0.000
% 12.52/2.05  #    Propositional solver time         : 0.000
% 12.52/2.05  #    Success case prop preproc time    : 0.000
% 12.52/2.05  #    Success case prop encoding time   : 0.000
% 12.52/2.05  #    Success case prop solver time     : 0.000
% 12.52/2.05  # Current number of processed clauses  : 1916
% 12.52/2.05  #    Positive orientable unit clauses  : 31
% 12.52/2.05  #    Positive unorientable unit clauses: 0
% 12.52/2.05  #    Negative unit clauses             : 5
% 12.52/2.05  #    Non-unit-clauses                  : 1880
% 12.52/2.05  # Current number of unprocessed clauses: 86060
% 12.52/2.05  # ...number of literals in the above   : 333768
% 12.52/2.05  # Current number of archived formulas  : 0
% 12.52/2.05  # Current number of archived clauses   : 128
% 12.52/2.05  # Clause-clause subsumption calls (NU) : 648759
% 12.52/2.05  # Rec. Clause-clause subsumption calls : 518640
% 12.52/2.05  # Non-unit clause-clause subsumptions  : 8968
% 12.52/2.05  # Unit Clause-clause subsumption calls : 824
% 12.52/2.05  # Rewrite failures with RHS unbound    : 0
% 12.52/2.05  # BW rewrite match attempts            : 32
% 12.52/2.05  # BW rewrite match successes           : 0
% 12.52/2.05  # Condensation attempts                : 0
% 12.52/2.05  # Condensation successes               : 0
% 12.52/2.05  # Termbank termtop insertions          : 1717634
% 12.52/2.05  
% 12.52/2.05  # -------------------------------------------------
% 12.52/2.05  # User time                : 1.538 s
% 12.52/2.05  # System time              : 0.052 s
% 12.52/2.05  # Total time               : 1.590 s
% 12.52/2.05  # Maximum resident set size: 1672 pages
% 12.52/2.05  
% 12.52/2.05  # -------------------------------------------------
% 12.52/2.05  # User time                : 7.856 s
% 12.52/2.05  # System time              : 0.085 s
% 12.52/2.05  # Total time               : 7.941 s
% 12.52/2.05  # Maximum resident set size: 1704 pages
% 12.52/2.05  % E---3.1 exiting
%------------------------------------------------------------------------------