↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : KLE067+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM

% Computer : n006.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Thu Sep 24 12:58:46 PM UTC 2026

% Result   : Theorem 0.15s 0.64s
% Output   : CNFRefutation 0.15s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   16 (  16 unt;   0 def)
%            Number of atoms       :   16 (  15 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    4 (   4   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   2 avg)
%            Maximal term depth    :    4 (   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   :   20 (   0 sgn  14   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(goals,conjecture,
    ! [X4,X5] : domain(addition(domain(X4),domain(X5))) = addition(domain(X4),domain(X5)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).

fof(domain5,axiom,
    ! [X4,X5] : domain(addition(X4,X5)) = addition(domain(X4),domain(X5)),
    file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+5.ax',domain5) ).

fof(domain2,axiom,
    ! [X4,X5] : domain(multiplication(X4,X5)) = domain(multiplication(X4,domain(X5))),
    file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+5.ax',domain2) ).

fof(multiplicative_left_identity,axiom,
    ! [X1] : multiplication(one,X1) = X1,
    file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',multiplicative_left_identity) ).

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

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

fof(c_0_6,plain,
    ! [X32,X33] : domain(addition(X32,X33)) = addition(domain(X32),domain(X33)),
    inference(variable_rename,[status(thm)],[domain5]) ).

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,plain,
    ! [X17] : multiplication(one,X17) = X17,
    inference(variable_rename,[status(thm)],[multiplicative_left_identity]) ).

cnf(c_0_9,negated_conjecture,
    domain(addition(domain(esk1_0),domain(esk2_0))) != addition(domain(esk1_0),domain(esk2_0)),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

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

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

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

cnf(c_0_13,negated_conjecture,
    domain(domain(addition(esk1_0,esk2_0))) != domain(addition(esk1_0,esk2_0)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_10]),c_0_10]) ).

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

cnf(c_0_15,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_14])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : KLE067+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.58  % Computer : n006.cluster.edu
% 0.11/0.58  % Model    : x86_64 x86_64
% 0.11/0.58  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.58  % Memory   : 8046.5625MB
% 0.11/0.58  % OS       : Linux 6.8.0-71-generic
% 0.11/0.58  % CPULimit : 300
% 0.11/0.58  % WCLimit  : 300
% 0.11/0.58  % DateTime : Sun Sep 20 22:41:29 UTC 2026
% 0.11/0.58  % CPUTime  : 
% 0.11/0.58  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.62  Running first-order theorem proving
% 0.11/0.62  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/benchmark/theBenchmark.p
% 0.15/0.64  % Version: 3.5.1
% 0.15/0.64  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.64  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.64  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.64  % Starting new_bool_3 with 300s (1) cores
% 0.15/0.64  % Starting new_bool_1 with 300s (1) cores
% 0.15/0.64  % Starting sh5l with 300s (1) cores
% 0.15/0.64  % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1414647 completed with status 0
% 0.15/0.64  % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.15/0.64  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.64  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.64  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.64  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/0.64  % No SInE strategy applied
% 0.15/0.64  % Search class: FHUSM-FFSF21-MFFFFFNN
% 0.15/0.64  % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.64  % Starting SubtermCWHack with 136s (1) cores
% 0.15/0.64  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.15/0.64  % Starting G-E--_300_C18_F1_SE_CS_SP_S0Y with 136s (1) cores
% 0.15/0.64  % Starting G-E--_092_C01_F1_AE_CS_SP_PS_CO_S0Y with 136s (1) cores
% 0.15/0.64  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (1) cores
% 0.15/0.64  % G-E--_300_C18_F1_SE_CS_SP_S0Y with pid 1414656 completed with status 0
% 0.15/0.64  % Result found by G-E--_300_C18_F1_SE_CS_SP_S0Y
% 0.15/0.64  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.64  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.64  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.64  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/0.64  % No SInE strategy applied
% 0.15/0.64  % Search class: FHUSM-FFSF21-MFFFFFNN
% 0.15/0.64  % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.64  % Starting SubtermCWHack with 136s (1) cores
% 0.15/0.64  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.15/0.64  % Starting G-E--_300_C18_F1_SE_CS_SP_S0Y with 136s (1) cores
% 0.15/0.64  % Preprocessing time       : 0.001 s
% 0.15/0.64  
% 0.15/0.64  % Proof found!
% 0.15/0.64  % SZS status Theorem
% 0.15/0.64  % SZS output start CNFRefutation
% See solution above
% 0.15/0.64  % Parsed axioms                        : 18
% 0.15/0.64  % Removed by relevancy pruning/SinE    : 0
% 0.15/0.64  % Initial clauses                      : 19
% 0.15/0.64  % Removed in clause preprocessing      : 0
% 0.15/0.64  % Initial clauses in saturation        : 19
% 0.15/0.64  % Processed clauses                    : 27
% 0.15/0.64  % ...of these trivial                  : 3
% 0.15/0.64  % ...subsumed                          : 2
% 0.15/0.64  % ...remaining for further processing  : 22
% 0.15/0.64  % Other redundant clauses eliminated   : 0
% 0.15/0.64  % Clauses deleted for lack of memory   : 0
% 0.15/0.64  % Backward-subsumed                    : 0
% 0.15/0.64  % Backward-rewritten                   : 4
% 0.15/0.64  % Generated clauses                    : 63
% 0.15/0.64  % ...of the previous two non-redundant : 29
% 0.15/0.64  % ...aggressively subsumed             : 0
% 0.15/0.64  % Contextual simplify-reflections      : 0
% 0.15/0.64  % Paramodulations                      : 63
% 0.15/0.64  % Factorizations                       : 0
% 0.15/0.64  % NegExts                              : 0
% 0.15/0.64  % Equation resolutions                 : 0
% 0.15/0.64  % Disequality decompositions           : 0
% 0.15/0.64  % Total rewrite steps                  : 61
% 0.15/0.64  % ...of those cached                   : 25
% 0.15/0.64  % Propositional unsat checks           : 0
% 0.15/0.64  %    Propositional check models        : 0
% 0.15/0.64  %    Propositional check unsatisfiable : 0
% 0.15/0.64  %    Propositional clauses             : 0
% 0.15/0.64  %    Propositional clauses after purity: 0
% 0.15/0.64  %    Propositional unsat core size     : 0
% 0.15/0.64  %    Propositional preprocessing time  : 0.000
% 0.15/0.64  %    Propositional encoding time       : 0.000
% 0.15/0.64  %    Propositional solver time         : 0.000
% 0.15/0.64  %    Success case prop preproc time    : 0.000
% 0.15/0.64  %    Success case prop encoding time   : 0.000
% 0.15/0.64  %    Success case prop solver time     : 0.000
% 0.15/0.64  % Current number of processed clauses  : 18
% 0.15/0.64  %    Positive orientable unit clauses  : 15
% 0.15/0.64  %    Positive unorientable unit clauses: 1
% 0.15/0.64  %    Negative unit clauses             : 0
% 0.15/0.64  %    Non-unit-clauses                  : 2
% 0.15/0.64  % Current number of unprocessed clauses: 20
% 0.15/0.64  % ...number of literals in the above   : 20
% 0.15/0.64  % Current number of archived formulas  : 0
% 0.15/0.64  % Current number of archived clauses   : 4
% 0.15/0.64  % Clause-clause subsumption calls (NU) : 0
% 0.15/0.64  % Rec. Clause-clause subsumption calls : 0
% 0.15/0.64  % Non-unit clause-clause subsumptions  : 0
% 0.15/0.64  % Unit Clause-clause subsumption calls : 1
% 0.15/0.64  % Rewrite failures with RHS unbound    : 0
% 0.15/0.64  % BW rewrite match attempts            : 22
% 0.15/0.64  % BW rewrite match successes           : 17
% 0.15/0.64  % Condensation attempts                : 0
% 0.15/0.64  % Condensation successes               : 0
% 0.15/0.64  % Termbank termtop insertions          : 1106
% 0.15/0.64  % Search garbage collected termcells   : 37
% 0.15/0.64  
% 0.15/0.64  % -------------------------------------------------
% 0.15/0.64  % User time                : 0.003 s
% 0.15/0.64  % System time              : 0.004 s
% 0.15/0.64  % Total time               : 0.006 s
% 0.15/0.64  % Maximum resident set size: 3596 pages
% 0.15/0.64  
% 0.15/0.64  % -------------------------------------------------
% 0.15/0.64  % User time                : 0.013 s
% 0.15/0.64  % System time              : 0.012 s
% 0.15/0.64  % Total time               : 0.025 s
% 0.15/0.64  % Maximum resident set size: 4608 pages
% 0.15/0.64  % E exiting
%------------------------------------------------------------------------------