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

View Problem - Process Solution

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

% Computer : n008.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:49 EDT 2023

% Result   : Theorem 0.20s 0.50s
% Output   : CNFRefutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   12 (  12 unt;   0 def)
%            Number of atoms       :   12 (  11 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   :   12 (   0 sgn;   8   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(goals,conjecture,
    ! [X4] : domain(domain(X4)) = domain(X4),
    file('/export/starexec/sandbox2/tmp/tmp.2xknXLjcWl/E---3.1_6921.p',goals) ).

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

fof(multiplicative_left_identity,axiom,
    ! [X1] : multiplication(one,X1) = X1,
    file('/export/starexec/sandbox2/tmp/tmp.2xknXLjcWl/E---3.1_6921.p',multiplicative_left_identity) ).

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

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

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

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

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

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

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

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