TSTP Solution File: KLE076+1 by E---3.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1
% Problem  : KLE076+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n003.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 18:04:05 EDT 2023

% Result   : Theorem 0.21s 0.51s
% Output   : CNFRefutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   13 (  13 unt;   0 def)
%            Number of atoms       :   13 (  12 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    3 (   3   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    3 (   2 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   2 con; 0-2 aty)
%            Number of variables   :   11 (   1 sgn;   8   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(goals,conjecture,
    ! [X4] : domain(multiplication(X4,domain(zero))) = zero,
    file('/export/starexec/sandbox2/tmp/tmp.u03ft7jHIy/E---3.1_30515.p',goals) ).

fof(domain2,axiom,
    ! [X4,X5] : domain(multiplication(X4,X5)) = domain(multiplication(X4,domain(X5))),
    file('/export/starexec/sandbox2/tmp/tmp.u03ft7jHIy/E---3.1_30515.p',domain2) ).

fof(right_annihilation,axiom,
    ! [X1] : multiplication(X1,zero) = zero,
    file('/export/starexec/sandbox2/tmp/tmp.u03ft7jHIy/E---3.1_30515.p',right_annihilation) ).

fof(domain4,axiom,
    domain(zero) = zero,
    file('/export/starexec/sandbox2/tmp/tmp.u03ft7jHIy/E---3.1_30515.p',domain4) ).

fof(c_0_4,negated_conjecture,
    ~ ! [X4] : domain(multiplication(X4,domain(zero))) = zero,
    inference(assume_negation,[status(cth)],[goals]) ).

fof(c_0_5,negated_conjecture,
    domain(multiplication(esk1_0,domain(zero))) != zero,
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).

fof(c_0_6,plain,
    ! [X11,X12] : domain(multiplication(X11,X12)) = domain(multiplication(X11,domain(X12))),
    inference(variable_rename,[status(thm)],[domain2]) ).

fof(c_0_7,plain,
    ! [X8] : multiplication(X8,zero) = zero,
    inference(variable_rename,[status(thm)],[right_annihilation]) ).

cnf(c_0_8,negated_conjecture,
    domain(multiplication(esk1_0,domain(zero))) != zero,
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_9,plain,
    domain(multiplication(X1,X2)) = domain(multiplication(X1,domain(X2))),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_10,plain,
    multiplication(X1,zero) = zero,
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_11,plain,
    domain(zero) = zero,
    inference(split_conjunct,[status(thm)],[domain4]) ).

cnf(c_0_12,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_9]),c_0_10]),c_0_11])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem    : KLE076+1 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.14  % Command    : run_E %s %d THM
% 0.14/0.35  % Computer : n003.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit   : 2400
% 0.14/0.35  % WCLimit    : 300
% 0.14/0.35  % DateTime   : Tue Oct  3 04:50:33 EDT 2023
% 0.14/0.35  % CPUTime    : 
% 0.21/0.50  Running first-order theorem proving
% 0.21/0.50  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.u03ft7jHIy/E---3.1_30515.p
% 0.21/0.51  # Version: 3.1pre001
% 0.21/0.51  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.51  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.51  # Starting new_bool_3 with 300s (1) cores
% 0.21/0.51  # Starting new_bool_1 with 300s (1) cores
% 0.21/0.51  # Starting sh5l with 300s (1) cores
% 0.21/0.51  # new_bool_3 with pid 30657 completed with status 0
% 0.21/0.51  # Result found by new_bool_3
% 0.21/0.51  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.51  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.51  # Starting new_bool_3 with 300s (1) cores
% 0.21/0.51  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.51  # Search class: FUUPM-FFSF21-MFFFFFNN
% 0.21/0.51  # Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.51  # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 135s (1) cores
% 0.21/0.51  # H----_047_C09_12_F1_AE_ND_CS_SP_S2S with pid 30661 completed with status 0
% 0.21/0.51  # Result found by H----_047_C09_12_F1_AE_ND_CS_SP_S2S
% 0.21/0.51  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.51  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.51  # Starting new_bool_3 with 300s (1) cores
% 0.21/0.51  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.51  # Search class: FUUPM-FFSF21-MFFFFFNN
% 0.21/0.51  # Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.51  # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 135s (1) cores
% 0.21/0.51  # Preprocessing time       : 0.001 s
% 0.21/0.51  # Presaturation interreduction done
% 0.21/0.51  
% 0.21/0.51  # Proof found!
% 0.21/0.51  # SZS status Theorem
% 0.21/0.51  # SZS output start CNFRefutation
% See solution above
% 0.21/0.51  # Parsed axioms                        : 18
% 0.21/0.51  # Removed by relevancy pruning/SinE    : 4
% 0.21/0.51  # Initial clauses                      : 14
% 0.21/0.51  # Removed in clause preprocessing      : 0
% 0.21/0.51  # Initial clauses in saturation        : 14
% 0.21/0.51  # Processed clauses                    : 9
% 0.21/0.51  # ...of these trivial                  : 0
% 0.21/0.51  # ...subsumed                          : 0
% 0.21/0.51  # ...remaining for further processing  : 9
% 0.21/0.51  # Other redundant clauses eliminated   : 0
% 0.21/0.51  # Clauses deleted for lack of memory   : 0
% 0.21/0.51  # Backward-subsumed                    : 0
% 0.21/0.51  # Backward-rewritten                   : 1
% 0.21/0.51  # Generated clauses                    : 0
% 0.21/0.51  # ...of the previous two non-redundant : 0
% 0.21/0.51  # ...aggressively subsumed             : 0
% 0.21/0.51  # Contextual simplify-reflections      : 0
% 0.21/0.51  # Paramodulations                      : 0
% 0.21/0.51  # Factorizations                       : 0
% 0.21/0.51  # NegExts                              : 0
% 0.21/0.51  # Equation resolutions                 : 0
% 0.21/0.51  # Total rewrite steps                  : 3
% 0.21/0.51  # Propositional unsat checks           : 0
% 0.21/0.51  #    Propositional check models        : 0
% 0.21/0.51  #    Propositional check unsatisfiable : 0
% 0.21/0.51  #    Propositional clauses             : 0
% 0.21/0.51  #    Propositional clauses after purity: 0
% 0.21/0.51  #    Propositional unsat core size     : 0
% 0.21/0.51  #    Propositional preprocessing time  : 0.000
% 0.21/0.51  #    Propositional encoding time       : 0.000
% 0.21/0.51  #    Propositional solver time         : 0.000
% 0.21/0.51  #    Success case prop preproc time    : 0.000
% 0.21/0.51  #    Success case prop encoding time   : 0.000
% 0.21/0.51  #    Success case prop solver time     : 0.000
% 0.21/0.51  # Current number of processed clauses  : 8
% 0.21/0.51  #    Positive orientable unit clauses  : 7
% 0.21/0.51  #    Positive unorientable unit clauses: 1
% 0.21/0.51  #    Negative unit clauses             : 0
% 0.21/0.51  #    Non-unit-clauses                  : 0
% 0.21/0.51  # Current number of unprocessed clauses: 5
% 0.21/0.51  # ...number of literals in the above   : 5
% 0.21/0.51  # Current number of archived formulas  : 0
% 0.21/0.51  # Current number of archived clauses   : 1
% 0.21/0.51  # Clause-clause subsumption calls (NU) : 0
% 0.21/0.51  # Rec. Clause-clause subsumption calls : 0
% 0.21/0.51  # Non-unit clause-clause subsumptions  : 0
% 0.21/0.51  # Unit Clause-clause subsumption calls : 0
% 0.21/0.51  # Rewrite failures with RHS unbound    : 0
% 0.21/0.51  # BW rewrite match attempts            : 6
% 0.21/0.51  # BW rewrite match successes           : 5
% 0.21/0.51  # Condensation attempts                : 0
% 0.21/0.51  # Condensation successes               : 0
% 0.21/0.51  # Termbank termtop insertions          : 489
% 0.21/0.51  
% 0.21/0.51  # -------------------------------------------------
% 0.21/0.51  # User time                : 0.002 s
% 0.21/0.51  # System time              : 0.002 s
% 0.21/0.51  # Total time               : 0.005 s
% 0.21/0.51  # Maximum resident set size: 1760 pages
% 0.21/0.51  
% 0.21/0.51  # -------------------------------------------------
% 0.21/0.51  # User time                : 0.002 s
% 0.21/0.51  # System time              : 0.006 s
% 0.21/0.51  # Total time               : 0.008 s
% 0.21/0.51  # Maximum resident set size: 1692 pages
% 0.21/0.51  % E---3.1 exiting
% 0.21/0.51  % E---3.1 exiting
%------------------------------------------------------------------------------