TSTP Solution File: SYN220-1 by E---3.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1
% Problem  : SYN220-1 : TPTP v8.1.2. Released v1.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n005.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:14:07 EDT 2023

% Result   : Unsatisfiable 0.41s 0.61s
% Output   : CNFRefutation 0.41s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    8
% Syntax   : Number of clauses     :   22 (  11 unt;   0 nHn;  22 RR)
%            Number of literals    :   35 (   0 equ;  15 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    8 (   7 usr;   1 prp; 0-3 aty)
%            Number of functors    :    2 (   2 usr;   2 con; 0-0 aty)
%            Number of variables   :   17 (   8 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(rule_001,axiom,
    ( k1(X1)
    | ~ n0(X2,X1) ),
    file('/export/starexec/sandbox2/tmp/tmp.ifU30uZsFD/E---3.1_4653.p',rule_001) ).

cnf(axiom_7,axiom,
    n0(d,b),
    file('/export/starexec/sandbox2/tmp/tmp.ifU30uZsFD/E---3.1_4653.p',axiom_7) ).

cnf(rule_136,axiom,
    ( m2(b)
    | ~ k1(b) ),
    file('/export/starexec/sandbox2/tmp/tmp.ifU30uZsFD/E---3.1_4653.p',rule_136) ).

cnf(rule_068,axiom,
    ( p1(X1,X1,X1)
    | ~ k0(X1) ),
    file('/export/starexec/sandbox2/tmp/tmp.ifU30uZsFD/E---3.1_4653.p',rule_068) ).

cnf(axiom_32,axiom,
    k0(b),
    file('/export/starexec/sandbox2/tmp/tmp.ifU30uZsFD/E---3.1_4653.p',axiom_32) ).

cnf(rule_217,axiom,
    ( l3(X1,X1)
    | ~ n2(X1)
    | ~ m2(b) ),
    file('/export/starexec/sandbox2/tmp/tmp.ifU30uZsFD/E---3.1_4653.p',rule_217) ).

cnf(rule_137,axiom,
    ( n2(X1)
    | ~ p1(X2,X3,X1) ),
    file('/export/starexec/sandbox2/tmp/tmp.ifU30uZsFD/E---3.1_4653.p',rule_137) ).

cnf(prove_this,negated_conjecture,
    ~ l3(X1,b),
    file('/export/starexec/sandbox2/tmp/tmp.ifU30uZsFD/E---3.1_4653.p',prove_this) ).

cnf(c_0_8,axiom,
    ( k1(X1)
    | ~ n0(X2,X1) ),
    rule_001 ).

cnf(c_0_9,axiom,
    n0(d,b),
    axiom_7 ).

cnf(c_0_10,axiom,
    ( m2(b)
    | ~ k1(b) ),
    rule_136 ).

cnf(c_0_11,plain,
    k1(b),
    inference(spm,[status(thm)],[c_0_8,c_0_9]) ).

cnf(c_0_12,axiom,
    ( p1(X1,X1,X1)
    | ~ k0(X1) ),
    rule_068 ).

cnf(c_0_13,axiom,
    k0(b),
    axiom_32 ).

cnf(c_0_14,axiom,
    ( l3(X1,X1)
    | ~ n2(X1)
    | ~ m2(b) ),
    rule_217 ).

cnf(c_0_15,plain,
    m2(b),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_11])]) ).

cnf(c_0_16,axiom,
    ( n2(X1)
    | ~ p1(X2,X3,X1) ),
    rule_137 ).

cnf(c_0_17,plain,
    p1(b,b,b),
    inference(spm,[status(thm)],[c_0_12,c_0_13]) ).

cnf(c_0_18,negated_conjecture,
    ~ l3(X1,b),
    prove_this ).

cnf(c_0_19,plain,
    ( l3(X1,X1)
    | ~ n2(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_15])]) ).

cnf(c_0_20,plain,
    n2(b),
    inference(spm,[status(thm)],[c_0_16,c_0_17]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.15  % Problem    : SYN220-1 : TPTP v8.1.2. Released v1.1.0.
% 0.12/0.16  % Command    : run_E %s %d THM
% 0.15/0.37  % Computer : n005.cluster.edu
% 0.15/0.37  % Model    : x86_64 x86_64
% 0.15/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37  % Memory   : 8042.1875MB
% 0.15/0.37  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37  % CPULimit   : 2400
% 0.15/0.37  % WCLimit    : 300
% 0.15/0.37  % DateTime   : Mon Oct  2 18:10:31 EDT 2023
% 0.15/0.37  % CPUTime    : 
% 0.38/0.56  Running first-order theorem proving
% 0.38/0.56  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/tmp/tmp.ifU30uZsFD/E---3.1_4653.p
% 0.41/0.61  # Version: 3.1pre001
% 0.41/0.61  # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.41/0.61  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.41/0.61  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.41/0.61  # Starting new_bool_3 with 300s (1) cores
% 0.41/0.61  # Starting new_bool_1 with 300s (1) cores
% 0.41/0.61  # Starting sh5l with 300s (1) cores
% 0.41/0.61  # new_bool_3 with pid 4750 completed with status 0
% 0.41/0.61  # Result found by new_bool_3
% 0.41/0.61  # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.41/0.61  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.41/0.61  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.41/0.61  # Starting new_bool_3 with 300s (1) cores
% 0.41/0.61  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.41/0.61  # Search class: FHUNM-FSLM00-SFFFFFNN
% 0.41/0.61  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.41/0.61  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.41/0.61  # SAT001_MinMin_p005000_rr_RG with pid 4755 completed with status 0
% 0.41/0.61  # Result found by SAT001_MinMin_p005000_rr_RG
% 0.41/0.61  # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.41/0.61  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.41/0.61  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.41/0.61  # Starting new_bool_3 with 300s (1) cores
% 0.41/0.61  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.41/0.61  # Search class: FHUNM-FSLM00-SFFFFFNN
% 0.41/0.61  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.41/0.61  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.41/0.61  # Preprocessing time       : 0.005 s
% 0.41/0.61  # Presaturation interreduction done
% 0.41/0.61  
% 0.41/0.61  # Proof found!
% 0.41/0.61  # SZS status Unsatisfiable
% 0.41/0.61  # SZS output start CNFRefutation
% See solution above
% 0.41/0.61  # Parsed axioms                        : 369
% 0.41/0.61  # Removed by relevancy pruning/SinE    : 30
% 0.41/0.61  # Initial clauses                      : 339
% 0.41/0.61  # Removed in clause preprocessing      : 6
% 0.41/0.61  # Initial clauses in saturation        : 333
% 0.41/0.61  # Processed clauses                    : 459
% 0.41/0.61  # ...of these trivial                  : 14
% 0.41/0.61  # ...subsumed                          : 23
% 0.41/0.61  # ...remaining for further processing  : 422
% 0.41/0.61  # Other redundant clauses eliminated   : 0
% 0.41/0.61  # Clauses deleted for lack of memory   : 0
% 0.41/0.61  # Backward-subsumed                    : 4
% 0.41/0.61  # Backward-rewritten                   : 18
% 0.41/0.61  # Generated clauses                    : 69
% 0.41/0.61  # ...of the previous two non-redundant : 62
% 0.41/0.61  # ...aggressively subsumed             : 0
% 0.41/0.61  # Contextual simplify-reflections      : 2
% 0.41/0.61  # Paramodulations                      : 69
% 0.41/0.61  # Factorizations                       : 0
% 0.41/0.61  # NegExts                              : 0
% 0.41/0.61  # Equation resolutions                 : 0
% 0.41/0.61  # Total rewrite steps                  : 107
% 0.41/0.61  # Propositional unsat checks           : 0
% 0.41/0.61  #    Propositional check models        : 0
% 0.41/0.61  #    Propositional check unsatisfiable : 0
% 0.41/0.61  #    Propositional clauses             : 0
% 0.41/0.61  #    Propositional clauses after purity: 0
% 0.41/0.61  #    Propositional unsat core size     : 0
% 0.41/0.61  #    Propositional preprocessing time  : 0.000
% 0.41/0.61  #    Propositional encoding time       : 0.000
% 0.41/0.61  #    Propositional solver time         : 0.000
% 0.41/0.61  #    Success case prop preproc time    : 0.000
% 0.41/0.61  #    Success case prop encoding time   : 0.000
% 0.41/0.61  #    Success case prop solver time     : 0.000
% 0.41/0.61  # Current number of processed clauses  : 101
% 0.41/0.61  #    Positive orientable unit clauses  : 65
% 0.41/0.61  #    Positive unorientable unit clauses: 0
% 0.41/0.61  #    Negative unit clauses             : 2
% 0.41/0.61  #    Non-unit-clauses                  : 34
% 0.41/0.61  # Current number of unprocessed clauses: 232
% 0.41/0.61  # ...number of literals in the above   : 693
% 0.41/0.61  # Current number of archived formulas  : 0
% 0.41/0.61  # Current number of archived clauses   : 321
% 0.41/0.61  # Clause-clause subsumption calls (NU) : 19611
% 0.41/0.61  # Rec. Clause-clause subsumption calls : 12569
% 0.41/0.61  # Non-unit clause-clause subsumptions  : 28
% 0.41/0.61  # Unit Clause-clause subsumption calls : 86
% 0.41/0.61  # Rewrite failures with RHS unbound    : 0
% 0.41/0.61  # BW rewrite match attempts            : 16
% 0.41/0.61  # BW rewrite match successes           : 15
% 0.41/0.61  # Condensation attempts                : 0
% 0.41/0.61  # Condensation successes               : 0
% 0.41/0.61  # Termbank termtop insertions          : 9451
% 0.41/0.61  
% 0.41/0.61  # -------------------------------------------------
% 0.41/0.61  # User time                : 0.032 s
% 0.41/0.61  # System time              : 0.006 s
% 0.41/0.61  # Total time               : 0.039 s
% 0.41/0.61  # Maximum resident set size: 2484 pages
% 0.41/0.61  
% 0.41/0.61  # -------------------------------------------------
% 0.41/0.61  # User time                : 0.038 s
% 0.41/0.61  # System time              : 0.008 s
% 0.41/0.61  # Total time               : 0.047 s
% 0.41/0.61  # Maximum resident set size: 1996 pages
% 0.41/0.61  % E---3.1 exiting
% 0.41/0.61  % E---3.1 exiting
%------------------------------------------------------------------------------