%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : KLE074+1 : TPTP v9.2.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n029.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 : 300s
% WCLimit : 300s
% DateTime : Tue May 5 04:35:39 PM UTC 2026
% Result : Theorem 1.20s 1.71s
% Output : CNFRefutation 1.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 3
% Syntax : Number of formulae : 14 ( 14 unt; 0 def)
% Number of atoms : 14 ( 13 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 5 ( 5 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 24 ( 0 sgn 16 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(goals,conjecture,
! [X4,X5,X6] : domain(multiplication(multiplication(X4,X5),domain(X6))) = domain(multiplication(X4,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(multiplicative_associativity,axiom,
! [X1,X2,X3] : multiplication(X1,multiplication(X2,X3)) = multiplication(multiplication(X1,X2),X3),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',multiplicative_associativity) ).
fof(c_0_3,negated_conjecture,
~ ! [X4,X5,X6] : domain(multiplication(multiplication(X4,X5),domain(X6))) = domain(multiplication(X4,domain(multiplication(X5,domain(X6))))),
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_4,negated_conjecture,
domain(multiplication(multiplication(esk1_0,esk2_0),domain(esk3_0))) != domain(multiplication(esk1_0,domain(multiplication(esk2_0,domain(esk3_0))))),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])]) ).
fof(c_0_5,plain,
! [X61,X62] : domain(multiplication(X61,X62)) = domain(multiplication(X61,domain(X62))),
inference(variable_rename,[status(thm)],[domain2]) ).
cnf(c_0_6,negated_conjecture,
domain(multiplication(multiplication(esk1_0,esk2_0),domain(esk3_0))) != domain(multiplication(esk1_0,domain(multiplication(esk2_0,domain(esk3_0))))),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,plain,
domain(multiplication(X1,X2)) = domain(multiplication(X1,domain(X2))),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_8,plain,
! [X45,X46,X47] : multiplication(X45,multiplication(X46,X47)) = multiplication(multiplication(X45,X46),X47),
inference(variable_rename,[status(thm)],[multiplicative_associativity]) ).
cnf(c_0_9,negated_conjecture,
domain(multiplication(esk1_0,multiplication(esk2_0,domain(esk3_0)))) != domain(multiplication(multiplication(esk1_0,esk2_0),esk3_0)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_6,c_0_7]),c_0_7]) ).
cnf(c_0_10,plain,
multiplication(X1,multiplication(X2,X3)) = multiplication(multiplication(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_11,negated_conjecture,
domain(multiplication(esk1_0,multiplication(esk2_0,domain(esk3_0)))) != domain(multiplication(esk1_0,multiplication(esk2_0,esk3_0))),
inference(rw,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_12,plain,
domain(multiplication(X1,multiplication(X2,domain(X3)))) = domain(multiplication(X1,multiplication(X2,X3))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_7]),c_0_7]) ).
cnf(c_0_13,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_12])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : KLE074+1 : TPTP v9.2.1. Released v4.0.0.
% 0.00/0.11 % Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.13/0.32 % Computer : n029.cluster.edu
% 0.13/0.32 % Model : x86_64 x86_64
% 0.13/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.32 % Memory : 8042.1875MB
% 0.13/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.32 % CPULimit : 300
% 0.13/0.32 % WCLimit : 300
% 0.13/0.32 % DateTime : Mon May 4 20:28:14 EDT 2026
% 0.13/0.32 % CPUTime :
% 0.13/0.33 % start to proof: theBenchmark
% 1.20/1.71 % Version : CSE_E---1.7
% 1.20/1.71 % Problem : theBenchmark.p
% 1.20/1.71 % SZS status Theorem for theBenchmark.p
% 1.20/1.71 % SZS output start CNFRefutation
% See solution above
% 1.20/1.71 % Total time : 1.374s
%------------------------------------------------------------------------------