TSTP Solution File: KLE075+1 by E-SAT---3.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E-SAT---3.1
% Problem  : KLE075+1 : TPTP v8.1.2. Released v4.0.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 18:04:52 EDT 2023

% Result   : Theorem 0.14s 0.41s
% Output   : CNFRefutation 0.14s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   13 (  13 unt;   0 def)
%            Number of atoms       :   13 (  12 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    4 (   4   ~;   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   :   12 (   0 sgn;   8   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(goals,conjecture,
    ! [X4] : domain(multiplication(one,domain(X4))) = domain(X4),
    file('/export/starexec/sandbox/tmp/tmp.ycIVspO48K/E---3.1_4279.p',goals) ).

fof(multiplicative_left_identity,axiom,
    ! [X1] : multiplication(one,X1) = X1,
    file('/export/starexec/sandbox/tmp/tmp.ycIVspO48K/E---3.1_4279.p',multiplicative_left_identity) ).

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

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

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

fof(c_0_5,plain,
    ! [X23] : multiplication(one,X23) = X23,
    inference(variable_rename,[status(thm)],[multiplicative_left_identity]) ).

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

cnf(c_0_7,negated_conjecture,
    domain(multiplication(one,domain(esk1_0))) != domain(esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_8,plain,
    multiplication(one,X1) = X1,
    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,negated_conjecture,
    domain(domain(esk1_0)) != domain(esk1_0),
    inference(rw,[status(thm)],[c_0_7,c_0_8]) ).

cnf(c_0_11,plain,
    domain(domain(X1)) = domain(X1),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_8]),c_0_8]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.09  % Problem    : KLE075+1 : TPTP v8.1.2. Released v4.0.0.
% 0.05/0.10  % Command    : run_E %s %d THM
% 0.10/0.30  % Computer : n031.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   : Tue Oct  3 05:18:13 EDT 2023
% 0.10/0.30  % CPUTime    : 
% 0.14/0.40  Running first-order model finding
% 0.14/0.40  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.ycIVspO48K/E---3.1_4279.p
% 0.14/0.41  # Version: 3.1pre001
% 0.14/0.41  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.41  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.41  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.41  # Starting new_bool_3 with 300s (1) cores
% 0.14/0.41  # Starting new_bool_1 with 300s (1) cores
% 0.14/0.41  # Starting sh5l with 300s (1) cores
% 0.14/0.41  # new_bool_3 with pid 4357 completed with status 0
% 0.14/0.41  # Result found by new_bool_3
% 0.14/0.41  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.41  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.41  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.41  # Starting new_bool_3 with 300s (1) cores
% 0.14/0.41  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.41  # Search class: FUUPM-FFSF21-MFFFFFNN
% 0.14/0.41  # Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.41  # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 135s (1) cores
% 0.14/0.41  # H----_047_C09_12_F1_AE_ND_CS_SP_S2S with pid 4360 completed with status 0
% 0.14/0.41  # Result found by H----_047_C09_12_F1_AE_ND_CS_SP_S2S
% 0.14/0.41  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.41  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.41  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.41  # Starting new_bool_3 with 300s (1) cores
% 0.14/0.41  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.41  # Search class: FUUPM-FFSF21-MFFFFFNN
% 0.14/0.41  # Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.41  # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 135s (1) cores
% 0.14/0.41  # Preprocessing time       : 0.001 s
% 0.14/0.41  # Presaturation interreduction done
% 0.14/0.41  
% 0.14/0.41  # Proof found!
% 0.14/0.41  # SZS status Theorem
% 0.14/0.41  # SZS output start CNFRefutation
% See solution above
% 0.14/0.41  # Parsed axioms                        : 18
% 0.14/0.41  # Removed by relevancy pruning/SinE    : 1
% 0.14/0.41  # Initial clauses                      : 17
% 0.14/0.41  # Removed in clause preprocessing      : 0
% 0.14/0.41  # Initial clauses in saturation        : 17
% 0.14/0.41  # Processed clauses                    : 34
% 0.14/0.41  # ...of these trivial                  : 1
% 0.14/0.41  # ...subsumed                          : 0
% 0.14/0.41  # ...remaining for further processing  : 33
% 0.14/0.41  # Other redundant clauses eliminated   : 0
% 0.14/0.41  # Clauses deleted for lack of memory   : 0
% 0.14/0.41  # Backward-subsumed                    : 0
% 0.14/0.41  # Backward-rewritten                   : 3
% 0.14/0.41  # Generated clauses                    : 24
% 0.14/0.41  # ...of the previous two non-redundant : 10
% 0.14/0.41  # ...aggressively subsumed             : 0
% 0.14/0.41  # Contextual simplify-reflections      : 0
% 0.14/0.41  # Paramodulations                      : 24
% 0.14/0.41  # Factorizations                       : 0
% 0.14/0.41  # NegExts                              : 0
% 0.14/0.41  # Equation resolutions                 : 0
% 0.14/0.41  # Total rewrite steps                  : 24
% 0.14/0.41  # Propositional unsat checks           : 0
% 0.14/0.41  #    Propositional check models        : 0
% 0.14/0.41  #    Propositional check unsatisfiable : 0
% 0.14/0.41  #    Propositional clauses             : 0
% 0.14/0.41  #    Propositional clauses after purity: 0
% 0.14/0.41  #    Propositional unsat core size     : 0
% 0.14/0.41  #    Propositional preprocessing time  : 0.000
% 0.14/0.41  #    Propositional encoding time       : 0.000
% 0.14/0.41  #    Propositional solver time         : 0.000
% 0.14/0.41  #    Success case prop preproc time    : 0.000
% 0.14/0.41  #    Success case prop encoding time   : 0.000
% 0.14/0.41  #    Success case prop solver time     : 0.000
% 0.14/0.41  # Current number of processed clauses  : 13
% 0.14/0.41  #    Positive orientable unit clauses  : 12
% 0.14/0.41  #    Positive unorientable unit clauses: 1
% 0.14/0.41  #    Negative unit clauses             : 0
% 0.14/0.41  #    Non-unit-clauses                  : 0
% 0.14/0.41  # Current number of unprocessed clauses: 10
% 0.14/0.41  # ...number of literals in the above   : 10
% 0.14/0.41  # Current number of archived formulas  : 0
% 0.14/0.41  # Current number of archived clauses   : 20
% 0.14/0.41  # Clause-clause subsumption calls (NU) : 0
% 0.14/0.41  # Rec. Clause-clause subsumption calls : 0
% 0.14/0.41  # Non-unit clause-clause subsumptions  : 0
% 0.14/0.41  # Unit Clause-clause subsumption calls : 0
% 0.14/0.41  # Rewrite failures with RHS unbound    : 0
% 0.14/0.41  # BW rewrite match attempts            : 16
% 0.14/0.41  # BW rewrite match successes           : 14
% 0.14/0.41  # Condensation attempts                : 0
% 0.14/0.41  # Condensation successes               : 0
% 0.14/0.41  # Termbank termtop insertions          : 833
% 0.14/0.41  
% 0.14/0.41  # -------------------------------------------------
% 0.14/0.41  # User time                : 0.004 s
% 0.14/0.41  # System time              : 0.001 s
% 0.14/0.41  # Total time               : 0.004 s
% 0.14/0.41  # Maximum resident set size: 1748 pages
% 0.14/0.41  
% 0.14/0.41  # -------------------------------------------------
% 0.14/0.41  # User time                : 0.005 s
% 0.14/0.41  # System time              : 0.002 s
% 0.14/0.41  # Total time               : 0.007 s
% 0.14/0.41  # Maximum resident set size: 1692 pages
% 0.14/0.41  % E---3.1 exiting
%------------------------------------------------------------------------------