%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : KLE053+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% Computer : n008.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:30 PM UTC 2026
% Result : Theorem 4.01s 0.99s
% Output : Proof 4.01s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 3
% Syntax : Number of formulae : 23 ( 23 unt; 0 def)
% Number of atoms : 23 ( 22 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 6 ( 6 ~; 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 : 24 ( 0 sgn 11 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f13,axiom,
! [X0,X1] : domain(multiplication(X0,X1)) = domain(multiplication(X0,domain(X1))),
file('/export/starexec/sandbox/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(f6,axiom,
! [A] : multiplication(one,A) = A,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiplicative_left_identity) ).
fof(f6_nnf,plain,
! [A] : multiplication(one,A) = A,
inference(nnf_transformation,[status(thm)],[f6]) ).
fof(f6_sk,plain,
! [A] : multiplication(one,A) = A,
inference(skolemisation,[status(esa)],[f6_nnf]) ).
cnf(c6,plain,
multiplication(one,X0) = X0,
inference(cnf_transformation,[status(esa)],[f6_sk]) ).
cnf(t8,plain,
multiplication(one,X1) = X1,
inference(equality_encoding,[status(esa)],[c6]) ).
cnf(t27,plain,
multiplication(one,X1) = X1,
inference(orient,[status(thm)],[t8]) ).
cnf(t78,plain,
domain(multiplication(one,X1)) = domain(domain(X1)),
inference(cp,[status(thm)],[t76,t27]) ).
cnf(t111,plain,
domain(X1) = domain(domain(X1)),
inference(step,[status(thm)],[t78,t27]) ).
cnf(t104,plain,
domain(domain(X1)) = domain(X1),
inference(orient,[status(thm)],[t111]) ).
fof(f17,conjecture,
! [X0] : domain(domain(X0)) = domain(X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
fof(f17_neg,negated_conjecture,
~ ! [X0] : domain(domain(X0)) = domain(X0),
inference(negated_conjecture,[status(cth)],[f17]) ).
fof(f17_nnf,plain,
? [X0] : domain(domain(X0)) != domain(X0),
inference(nnf_transformation,[status(thm)],[f17_neg]) ).
fof(f17_sk,plain,
domain(domain(sk0)) != domain(sk0),
inference(skolemisation,[status(esa),new_symbols(skolem,[sk0])],[f17_nnf]) ).
cnf(c18,plain,
domain(domain(sk0)) != domain(sk0),
inference(cnf_transformation,[status(esa)],[f17_sk]) ).
cnf(goal_0,negated_conjecture,
domain(domain(sk0)) != domain(sk0),
inference(equality_encoding,[status(esa)],[c18]) ).
cnf(g0_0,plain,
domain(sk0) != domain(sk0),
inference(rw,[status(thm)],[goal_0,t104]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : KLE053+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.03 % Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.08/0.35 % Computer : n008.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.08/0.35 % CPULimit : 300
% 0.08/0.35 % WCLimit : 300
% 0.08/0.35 % DateTime : Wed Sep 23 18:49:08 UTC 2026
% 0.08/0.36 % CPUTime :
% 0.08/0.36 Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 4.01/0.99 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.01/0.99 % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------