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

View Problem - Process Solution

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

% Computer : n031.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 19:39:30 EDT 2023

% Result   : Unsatisfiable 0.16s 0.43s
% Output   : CNFRefutation 0.16s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    7
% Syntax   : Number of clauses     :   19 (  16 unt;   3 nHn;  19 RR)
%            Number of literals    :   27 (   6 equ;  10 neg)
%            Maximal clause size   :    4 (   1 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   3 con; 0-0 aty)
%            Number of variables   :    5 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(co1_2,negated_conjecture,
    ssList(sk2),
    file('/export/starexec/sandbox2/tmp/tmp.t55RDXUJn3/E---3.1_21349.p',co1_2) ).

cnf(co1_5,negated_conjecture,
    sk2 = sk4,
    file('/export/starexec/sandbox2/tmp/tmp.t55RDXUJn3/E---3.1_21349.p',co1_5) ).

cnf(clause100,axiom,
    ( neq(X2,X1)
    | X2 = X1
    | ~ ssList(X1)
    | ~ ssList(X2) ),
    file('/export/starexec/sandbox2/tmp/tmp.t55RDXUJn3/E---3.1_21349.p',clause100) ).

cnf(co1_8,negated_conjecture,
    ~ cyclefreeP(sk2),
    file('/export/starexec/sandbox2/tmp/tmp.t55RDXUJn3/E---3.1_21349.p',co1_8) ).

cnf(clause8,axiom,
    ssList(nil),
    file('/export/starexec/sandbox2/tmp/tmp.t55RDXUJn3/E---3.1_21349.p',clause8) ).

cnf(co1_7,negated_conjecture,
    ~ neq(sk4,nil),
    file('/export/starexec/sandbox2/tmp/tmp.t55RDXUJn3/E---3.1_21349.p',co1_7) ).

cnf(clause7,axiom,
    cyclefreeP(nil),
    file('/export/starexec/sandbox2/tmp/tmp.t55RDXUJn3/E---3.1_21349.p',clause7) ).

cnf(c_0_7,negated_conjecture,
    ssList(sk2),
    co1_2 ).

cnf(c_0_8,negated_conjecture,
    sk2 = sk4,
    co1_5 ).

cnf(c_0_9,axiom,
    ( neq(X2,X1)
    | X2 = X1
    | ~ ssList(X1)
    | ~ ssList(X2) ),
    clause100 ).

cnf(c_0_10,negated_conjecture,
    ssList(sk4),
    inference(rw,[status(thm)],[c_0_7,c_0_8]) ).

cnf(c_0_11,negated_conjecture,
    ~ cyclefreeP(sk2),
    co1_8 ).

cnf(c_0_12,negated_conjecture,
    ( X1 = sk4
    | neq(sk4,X1)
    | ~ ssList(X1) ),
    inference(spm,[status(thm)],[c_0_9,c_0_10]) ).

cnf(c_0_13,axiom,
    ssList(nil),
    clause8 ).

cnf(c_0_14,negated_conjecture,
    ~ neq(sk4,nil),
    co1_7 ).

cnf(c_0_15,negated_conjecture,
    ~ cyclefreeP(sk4),
    inference(rw,[status(thm)],[c_0_11,c_0_8]) ).

cnf(c_0_16,negated_conjecture,
    sk4 = nil,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]) ).

cnf(c_0_17,axiom,
    cyclefreeP(nil),
    clause7 ).

cnf(c_0_18,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_16]),c_0_17])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.10  % Problem    : SWC130-1 : TPTP v8.1.2. Released v2.4.0.
% 0.09/0.11  % Command    : run_E %s %d THM
% 0.10/0.31  % Computer : n031.cluster.edu
% 0.10/0.31  % Model    : x86_64 x86_64
% 0.10/0.31  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31  % Memory   : 8042.1875MB
% 0.10/0.31  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31  % CPULimit   : 2400
% 0.10/0.31  % WCLimit    : 300
% 0.10/0.31  % DateTime   : Tue Oct  3 02:19:15 EDT 2023
% 0.10/0.31  % CPUTime    : 
% 0.16/0.42  Running first-order theorem proving
% 0.16/0.42  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.t55RDXUJn3/E---3.1_21349.p
% 0.16/0.43  # Version: 3.1pre001
% 0.16/0.43  # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.16/0.43  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.43  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.16/0.43  # Starting new_bool_3 with 300s (1) cores
% 0.16/0.43  # Starting new_bool_1 with 300s (1) cores
% 0.16/0.43  # Starting sh5l with 300s (1) cores
% 0.16/0.43  # new_bool_3 with pid 21428 completed with status 0
% 0.16/0.43  # Result found by new_bool_3
% 0.16/0.43  # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.16/0.43  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.43  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.16/0.43  # Starting new_bool_3 with 300s (1) cores
% 0.16/0.43  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.43  # Search class: FGHSF-FFMM22-MFFFFFNN
% 0.16/0.43  # partial match(1): FGHSF-FFMM21-MFFFFFNN
% 0.16/0.43  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.43  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.16/0.43  # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 21431 completed with status 0
% 0.16/0.43  # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.16/0.43  # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.16/0.43  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.43  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.16/0.43  # Starting new_bool_3 with 300s (1) cores
% 0.16/0.43  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.43  # Search class: FGHSF-FFMM22-MFFFFFNN
% 0.16/0.43  # partial match(1): FGHSF-FFMM21-MFFFFFNN
% 0.16/0.43  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.43  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.16/0.43  # Preprocessing time       : 0.001 s
% 0.16/0.43  # Presaturation interreduction done
% 0.16/0.43  
% 0.16/0.43  # Proof found!
% 0.16/0.43  # SZS status Unsatisfiable
% 0.16/0.43  # SZS output start CNFRefutation
% See solution above
% 0.16/0.43  # Parsed axioms                        : 193
% 0.16/0.43  # Removed by relevancy pruning/SinE    : 150
% 0.16/0.43  # Initial clauses                      : 43
% 0.16/0.43  # Removed in clause preprocessing      : 0
% 0.16/0.43  # Initial clauses in saturation        : 43
% 0.16/0.43  # Processed clauses                    : 79
% 0.16/0.43  # ...of these trivial                  : 2
% 0.16/0.43  # ...subsumed                          : 2
% 0.16/0.43  # ...remaining for further processing  : 75
% 0.16/0.43  # Other redundant clauses eliminated   : 6
% 0.16/0.43  # Clauses deleted for lack of memory   : 0
% 0.16/0.43  # Backward-subsumed                    : 0
% 0.16/0.43  # Backward-rewritten                   : 5
% 0.16/0.43  # Generated clauses                    : 22
% 0.16/0.43  # ...of the previous two non-redundant : 19
% 0.16/0.43  # ...aggressively subsumed             : 0
% 0.16/0.43  # Contextual simplify-reflections      : 0
% 0.16/0.43  # Paramodulations                      : 17
% 0.16/0.43  # Factorizations                       : 0
% 0.16/0.43  # NegExts                              : 0
% 0.16/0.43  # Equation resolutions                 : 6
% 0.16/0.43  # Total rewrite steps                  : 17
% 0.16/0.43  # Propositional unsat checks           : 0
% 0.16/0.43  #    Propositional check models        : 0
% 0.16/0.43  #    Propositional check unsatisfiable : 0
% 0.16/0.43  #    Propositional clauses             : 0
% 0.16/0.43  #    Propositional clauses after purity: 0
% 0.16/0.43  #    Propositional unsat core size     : 0
% 0.16/0.43  #    Propositional preprocessing time  : 0.000
% 0.16/0.43  #    Propositional encoding time       : 0.000
% 0.16/0.43  #    Propositional solver time         : 0.000
% 0.16/0.43  #    Success case prop preproc time    : 0.000
% 0.16/0.43  #    Success case prop encoding time   : 0.000
% 0.16/0.43  #    Success case prop solver time     : 0.000
% 0.16/0.43  # Current number of processed clauses  : 26
% 0.16/0.43  #    Positive orientable unit clauses  : 6
% 0.16/0.43  #    Positive unorientable unit clauses: 0
% 0.16/0.43  #    Negative unit clauses             : 0
% 0.16/0.43  #    Non-unit-clauses                  : 20
% 0.16/0.43  # Current number of unprocessed clauses: 20
% 0.16/0.43  # ...number of literals in the above   : 97
% 0.16/0.43  # Current number of archived formulas  : 0
% 0.16/0.43  # Current number of archived clauses   : 44
% 0.16/0.43  # Clause-clause subsumption calls (NU) : 337
% 0.16/0.43  # Rec. Clause-clause subsumption calls : 70
% 0.16/0.43  # Non-unit clause-clause subsumptions  : 2
% 0.16/0.43  # Unit Clause-clause subsumption calls : 10
% 0.16/0.43  # Rewrite failures with RHS unbound    : 0
% 0.16/0.43  # BW rewrite match attempts            : 1
% 0.16/0.43  # BW rewrite match successes           : 1
% 0.16/0.43  # Condensation attempts                : 0
% 0.16/0.43  # Condensation successes               : 0
% 0.16/0.43  # Termbank termtop insertions          : 3127
% 0.16/0.43  
% 0.16/0.43  # -------------------------------------------------
% 0.16/0.43  # User time                : 0.006 s
% 0.16/0.43  # System time              : 0.000 s
% 0.16/0.43  # Total time               : 0.007 s
% 0.16/0.43  # Maximum resident set size: 1996 pages
% 0.16/0.43  
% 0.16/0.43  # -------------------------------------------------
% 0.16/0.43  # User time                : 0.010 s
% 0.16/0.43  # System time              : 0.002 s
% 0.16/0.43  # Total time               : 0.012 s
% 0.16/0.43  # Maximum resident set size: 1848 pages
% 0.16/0.43  % E---3.1 exiting
% 0.16/0.44  % E---3.1 exiting
%------------------------------------------------------------------------------