↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : KLE072+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:47 PM UTC 2026

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

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

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(domain5,axiom,
    ! [X4,X5] : domain(addition(X4,X5)) = addition(domain(X4),domain(X5)),
    file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+5.ax',domain5) ).

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

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

fof(c_0_5,negated_conjecture,
    domain(multiplication(addition(esk1_0,esk2_0),domain(esk3_0))) != addition(domain(multiplication(esk1_0,domain(esk3_0))),domain(multiplication(esk2_0,domain(esk3_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,
    ! [X30,X31] : domain(multiplication(X30,X31)) = domain(multiplication(X30,domain(X31))),
    inference(variable_rename,[status(thm)],[domain2]) ).

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

fof(c_0_8,plain,
    ! [X22,X23,X24] : multiplication(addition(X22,X23),X24) = addition(multiplication(X22,X24),multiplication(X23,X24)),
    inference(variable_rename,[status(thm)],[left_distributivity]) ).

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

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

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

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

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

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