%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : KLE074+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% Computer : n016.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 : Fri Sep 25 01:51:33 PM UTC 2026
% Result : Theorem 0.14s 10.86s
% Output : Proof 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 3
% Syntax : Number of formulae : 21 ( 21 unt; 0 def)
% Number of atoms : 21 ( 20 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 7 ( 7 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 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 : 39 ( 0 sgn 21 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f4,axiom,
! [A,B,C] : multiplication(A,multiplication(B,C)) = multiplication(multiplication(A,B),C),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiplicative_associativity) ).
fof(f4_nnf,plain,
! [A,B,C] : multiplication(A,multiplication(B,C)) = multiplication(multiplication(A,B),C),
inference(nnf_transformation,[status(thm)],[f4]) ).
fof(f4_sk,plain,
! [A,B,C] : multiplication(A,multiplication(B,C)) = multiplication(multiplication(A,B),C),
inference(skolemisation,[status(esa)],[f4_nnf]) ).
cnf(c4,plain,
multiplication(X0,multiplication(X1,X2)) = multiplication(multiplication(X0,X1),X2),
inference(cnf_transformation,[status(esa)],[f4_sk]) ).
cnf(t21,plain,
multiplication(multiplication(X1,X2),X3) = multiplication(X1,multiplication(X2,X3)),
inference(equality_encoding,[status(esa)],[c4]) ).
cnf(t66,plain,
multiplication(multiplication(X1,X2),X3) = multiplication(X1,multiplication(X2,X3)),
inference(orient,[status(thm)],[t21]) ).
fof(f13,axiom,
! [X0,X1] : domain(multiplication(X0,X1)) = domain(multiplication(X0,domain(X1))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',domain2) ).
fof(f13_nnf,plain,
! [X0,X1] : domain(multiplication(X0,X1)) = domain(multiplication(X0,domain(X1))),
inference(nnf_transformation,[status(thm)],[f13]) ).
fof(f13_sk,plain,
! [X0,X1] : domain(multiplication(X0,X1)) = domain(multiplication(X0,domain(X1))),
inference(skolemisation,[status(esa)],[f13_nnf]) ).
cnf(c14,plain,
domain(multiplication(X0,X1)) = domain(multiplication(X0,domain(X1))),
inference(cnf_transformation,[status(esa)],[f13_sk]) ).
cnf(t16,plain,
domain(multiplication(X1,domain(X2))) = domain(multiplication(X1,X2)),
inference(equality_encoding,[status(esa)],[c14]) ).
cnf(t76,plain,
domain(multiplication(X1,domain(X2))) = domain(multiplication(X1,X2)),
inference(orient,[status(thm)],[t16]) ).
fof(f17,conjecture,
! [X0,X1,X2] : domain(multiplication(multiplication(X0,X1),domain(X2))) = domain(multiplication(X0,domain(multiplication(X1,domain(X2))))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(f17_neg,negated_conjecture,
~ ! [X0,X1,X2] : domain(multiplication(multiplication(X0,X1),domain(X2))) = domain(multiplication(X0,domain(multiplication(X1,domain(X2))))),
inference(negated_conjecture,[status(cth)],[f17]) ).
fof(f17_nnf,plain,
? [X0,X1,X2] : domain(multiplication(multiplication(X0,X1),domain(X2))) != domain(multiplication(X0,domain(multiplication(X1,domain(X2))))),
inference(nnf_transformation,[status(thm)],[f17_neg]) ).
fof(f17_sk,plain,
domain(multiplication(multiplication(sk0,sk1),domain(sk2))) != domain(multiplication(sk0,domain(multiplication(sk1,domain(sk2))))),
inference(skolemisation,[status(esa),new_symbols(skolem,[sk0,sk1,sk2])],[f17_nnf]) ).
cnf(c18,plain,
domain(multiplication(multiplication(sk0,sk1),domain(sk2))) != domain(multiplication(sk0,domain(multiplication(sk1,domain(sk2))))),
inference(cnf_transformation,[status(esa)],[f17_sk]) ).
cnf(goal_0,negated_conjecture,
domain(multiplication(sk0,domain(multiplication(sk1,domain(sk2))))) != domain(multiplication(multiplication(sk0,sk1),domain(sk2))),
inference(equality_encoding,[status(esa)],[c18]) ).
cnf(g0_0,plain,
domain(multiplication(sk0,multiplication(sk1,domain(sk2)))) != domain(multiplication(multiplication(sk0,sk1),domain(sk2))),
inference(rw,[status(thm)],[goal_0,t66]) ).
cnf(g0_1,plain,
domain(multiplication(sk0,multiplication(sk1,domain(sk2)))) != domain(multiplication(sk0,multiplication(sk1,domain(sk2)))),
inference(rw,[status(thm)],[g0_0,t76]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_1]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : KLE074+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.03 % Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.10/10.38 % Computer : n016.cluster.edu
% 0.10/10.38 % Model : x86_64 x86_64
% 0.10/10.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/10.38 % Memory : 8046.5625MB
% 0.10/10.38 % OS : Linux 6.8.0-71-generic
% 0.10/10.38 % CPULimit : 300
% 0.10/10.38 % WCLimit : 300
% 0.10/10.38 % DateTime : Wed Sep 23 18:55:53 UTC 2026
% 0.10/10.38 % CPUTime :
% 0.10/10.38 Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.14/10.86 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.14/10.86 % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------