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

View Problem - Process Solution

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

% Computer : n017.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:03 EDT 2023

% Result   : Theorem 0.16s 0.43s
% Output   : CNFRefutation 0.16s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   21 (  18 unt;   0 def)
%            Number of atoms       :   24 (  23 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :    6 (   3   ~;   0   |;   1   &)
%                                         (   0 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   2 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   3 con; 0-2 aty)
%            Number of variables   :   21 (   1 sgn;  14   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(domain1,axiom,
    ! [X4] : addition(X4,multiplication(domain(X4),X4)) = multiplication(domain(X4),X4),
    file('/export/starexec/sandbox2/tmp/tmp.utPU2kLG01/E---3.1_26100.p',domain1) ).

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

fof(goals,conjecture,
    ! [X4,X5] :
      ( multiplication(X4,X5) = zero
     => multiplication(X4,domain(X5)) = zero ),
    file('/export/starexec/sandbox2/tmp/tmp.utPU2kLG01/E---3.1_26100.p',goals) ).

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

fof(additive_identity,axiom,
    ! [X1] : addition(X1,zero) = X1,
    file('/export/starexec/sandbox2/tmp/tmp.utPU2kLG01/E---3.1_26100.p',additive_identity) ).

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

fof(c_0_6,plain,
    ! [X28] : addition(X28,multiplication(domain(X28),X28)) = multiplication(domain(X28),X28),
    inference(variable_rename,[status(thm)],[domain1]) ).

fof(c_0_7,plain,
    ! [X29,X30] : domain(multiplication(X29,X30)) = domain(multiplication(X29,domain(X30))),
    inference(variable_rename,[status(thm)],[domain2]) ).

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

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

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

fof(c_0_11,negated_conjecture,
    ( multiplication(esk1_0,esk2_0) = zero
    & multiplication(esk1_0,domain(esk2_0)) != zero ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])]) ).

fof(c_0_12,plain,
    ! [X25] : multiplication(zero,X25) = zero,
    inference(variable_rename,[status(thm)],[left_annihilation]) ).

fof(c_0_13,plain,
    ! [X11] : addition(X11,zero) = X11,
    inference(variable_rename,[status(thm)],[additive_identity]) ).

cnf(c_0_14,plain,
    addition(multiplication(X1,domain(X2)),multiplication(domain(multiplication(X1,X2)),multiplication(X1,domain(X2)))) = multiplication(domain(multiplication(X1,X2)),multiplication(X1,domain(X2))),
    inference(spm,[status(thm)],[c_0_9,c_0_10]) ).

cnf(c_0_15,negated_conjecture,
    multiplication(esk1_0,esk2_0) = zero,
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

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

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

cnf(c_0_18,plain,
    addition(X1,zero) = X1,
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

cnf(c_0_19,negated_conjecture,
    multiplication(esk1_0,domain(esk2_0)) != zero,
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_20,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]),c_0_17]),c_0_18]),c_0_16]),c_0_17]),c_0_19]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10  % Problem    : KLE065+1 : TPTP v8.1.2. Released v4.0.0.
% 0.05/0.11  % Command    : run_E %s %d THM
% 0.10/0.31  % Computer : n017.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 04:10:41 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.utPU2kLG01/E---3.1_26100.p
% 0.16/0.43  # Version: 3.1pre001
% 0.16/0.43  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.43  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.43  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN 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  # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 26179 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: FSMSSMSSSSSNFFN.
% 0.16/0.43  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.43  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.43  # No SInE strategy applied
% 0.16/0.43  # Search class: FHUSM-FFSF21-MFFFFFNN
% 0.16/0.43  # Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.43  # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.16/0.43  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.16/0.43  # Starting G-E--_092_C01_F1_AE_CS_SP_PS_CO_S0Y with 136s (1) cores
% 0.16/0.43  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (1) cores
% 0.16/0.43  # Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2U with 136s (1) cores
% 0.16/0.43  # G-E--_092_C01_F1_AE_CS_SP_PS_CO_S0Y with pid 26186 completed with status 0
% 0.16/0.43  # Result found by G-E--_092_C01_F1_AE_CS_SP_PS_CO_S0Y
% 0.16/0.43  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.43  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.43  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.43  # No SInE strategy applied
% 0.16/0.43  # Search class: FHUSM-FFSF21-MFFFFFNN
% 0.16/0.43  # Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.43  # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.16/0.43  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.16/0.43  # Starting G-E--_092_C01_F1_AE_CS_SP_PS_CO_S0Y with 136s (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 Theorem
% 0.16/0.43  # SZS output start CNFRefutation
% See solution above
% 0.16/0.43  # Parsed axioms                        : 18
% 0.16/0.43  # Removed by relevancy pruning/SinE    : 0
% 0.16/0.43  # Initial clauses                      : 20
% 0.16/0.43  # Removed in clause preprocessing      : 0
% 0.16/0.43  # Initial clauses in saturation        : 20
% 0.16/0.43  # Processed clauses                    : 108
% 0.16/0.43  # ...of these trivial                  : 28
% 0.16/0.43  # ...subsumed                          : 10
% 0.16/0.43  # ...remaining for further processing  : 70
% 0.16/0.43  # Other redundant clauses eliminated   : 0
% 0.16/0.43  # Clauses deleted for lack of memory   : 0
% 0.16/0.43  # Backward-subsumed                    : 0
% 0.16/0.43  # Backward-rewritten                   : 4
% 0.16/0.43  # Generated clauses                    : 615
% 0.16/0.43  # ...of the previous two non-redundant : 268
% 0.16/0.43  # ...aggressively subsumed             : 0
% 0.16/0.43  # Contextual simplify-reflections      : 0
% 0.16/0.43  # Paramodulations                      : 615
% 0.16/0.43  # Factorizations                       : 0
% 0.16/0.43  # NegExts                              : 0
% 0.16/0.43  # Equation resolutions                 : 0
% 0.16/0.43  # Total rewrite steps                  : 849
% 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  : 46
% 0.16/0.43  #    Positive orientable unit clauses  : 41
% 0.16/0.43  #    Positive unorientable unit clauses: 2
% 0.16/0.43  #    Negative unit clauses             : 1
% 0.16/0.43  #    Non-unit-clauses                  : 2
% 0.16/0.43  # Current number of unprocessed clauses: 191
% 0.16/0.43  # ...number of literals in the above   : 191
% 0.16/0.43  # Current number of archived formulas  : 0
% 0.16/0.44  # Current number of archived clauses   : 24
% 0.16/0.44  # Clause-clause subsumption calls (NU) : 0
% 0.16/0.44  # Rec. Clause-clause subsumption calls : 0
% 0.16/0.44  # Non-unit clause-clause subsumptions  : 0
% 0.16/0.44  # Unit Clause-clause subsumption calls : 1
% 0.16/0.44  # Rewrite failures with RHS unbound    : 0
% 0.16/0.44  # BW rewrite match attempts            : 40
% 0.16/0.44  # BW rewrite match successes           : 25
% 0.16/0.44  # Condensation attempts                : 108
% 0.16/0.44  # Condensation successes               : 0
% 0.16/0.44  # Termbank termtop insertions          : 7156
% 0.16/0.44  
% 0.16/0.44  # -------------------------------------------------
% 0.16/0.44  # User time                : 0.006 s
% 0.16/0.44  # System time              : 0.004 s
% 0.16/0.44  # Total time               : 0.010 s
% 0.16/0.44  # Maximum resident set size: 1724 pages
% 0.16/0.44  
% 0.16/0.44  # -------------------------------------------------
% 0.16/0.44  # User time                : 0.038 s
% 0.16/0.44  # System time              : 0.008 s
% 0.16/0.44  # Total time               : 0.046 s
% 0.16/0.44  # Maximum resident set size: 1688 pages
% 0.16/0.44  % E---3.1 exiting
% 0.16/0.44  % E---3.1 exiting
%------------------------------------------------------------------------------