%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : GRP028-4 : TPTP v9.3.1. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% Computer : n014.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:24:59 PM UTC 2026
% Result : Unsatisfiable 3.43s 0.84s
% Output : Proof 3.43s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 6
% Syntax : Number of formulae : 31 ( 27 unt; 0 def)
% Number of atoms : 43 ( 14 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 30 ( 18 ~; 12 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-4 aty)
% Number of variables : 62 ( 0 sgn 22 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
cnf(f4,negated_conjecture,
~ product(not_identity(X),X,not_identity(X)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_there_is_a_right_identity) ).
fof(f4_nnf,plain,
! [X] : ~ product(not_identity(X),X,not_identity(X)),
inference(nnf_transformation,[status(thm)],[f4]) ).
fof(f4_sk,plain,
! [X] : ~ product(not_identity(X),X,not_identity(X)),
inference(skolemisation,[status(esa)],[f4_nnf]) ).
cnf(c4,plain,
~ product(not_identity(X0),X0,not_identity(X0)),
inference(cnf_transformation,[status(esa)],[f4_sk]) ).
cnf(t6,plain,
eq(product(not_identity(X1),X1,not_identity(X1)),true) = efalse,
inference(equality_encoding,[status(esa)],[c4]) ).
cnf(t109,plain,
eq(product(not_identity(X1),X1,not_identity(X1)),true) = efalse,
inference(orient,[status(thm)],[t6]) ).
cnf(f0,axiom,
( product(U,Z,W)
| ~ product(X,V,W)
| ~ product(Y,Z,V)
| ~ product(X,Y,U) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',associativity1) ).
fof(f0_nnf,plain,
! [X,Y,U,Z,V,W] :
( product(U,Z,W)
| ~ product(X,V,W)
| ~ product(Y,Z,V)
| ~ product(X,Y,U) ),
inference(nnf_transformation,[status(thm)],[f0]) ).
fof(f0_sk,plain,
! [X,Y,U,Z,V,W] :
( product(U,Z,W)
| ~ product(X,V,W)
| ~ product(Y,Z,V)
| ~ product(X,Y,U) ),
inference(skolemisation,[status(esa)],[f0_nnf]) ).
cnf(c0,plain,
( product(X2,X3,X5)
| ~ product(X0,X4,X5)
| ~ product(X1,X3,X4)
| ~ product(X0,X1,X2) ),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(hi0,axiom,
ifeq(product(X0,X1,X2),true,ifeq(product(X1,X3,X4),true,ifeq(product(X0,X4,X5),true,product(X2,X3,X5),true),true),true) = true,
inference(equality_encoding,[status(esa)],[c0]) ).
cnf(f2,hypothesis,
product(left_solution(X,Y),X,Y),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',left_soln) ).
fof(f2_nnf,plain,
! [X,Y] : product(left_solution(X,Y),X,Y),
inference(nnf_transformation,[status(thm)],[f2]) ).
fof(f2_sk,plain,
! [X,Y] : product(left_solution(X,Y),X,Y),
inference(skolemisation,[status(esa)],[f2_nnf]) ).
cnf(c2,plain,
product(left_solution(X0,X1),X0,X1),
inference(cnf_transformation,[status(esa)],[f2_sk]) ).
cnf(hi2,axiom,
product(left_solution(X0,X1),X0,X1) = true,
inference(equality_encoding,[status(esa)],[c2]) ).
cnf(f3,hypothesis,
product(X,right_solution(X,Y),Y),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',right_soln) ).
fof(f3_nnf,plain,
! [X,Y] : product(X,right_solution(X,Y),Y),
inference(nnf_transformation,[status(thm)],[f3]) ).
fof(f3_sk,plain,
! [X,Y] : product(X,right_solution(X,Y),Y),
inference(skolemisation,[status(esa)],[f3_nnf]) ).
cnf(c3,plain,
product(X0,right_solution(X0,X1),X1),
inference(cnf_transformation,[status(esa)],[f3_sk]) ).
cnf(hi3,axiom,
product(X0,right_solution(X0,X1),X1) = true,
inference(equality_encoding,[status(esa)],[c3]) ).
cnf(t3,plain,
product(X1,right_solution(X2,X2),X1) = true,
inference(hyper_resolution,[status(thm)],[hi0,hi2,hi3,hi2]) ).
cnf(t16,plain,
product(X1,right_solution(X2,X2),X1) = true,
inference(orient,[status(thm)],[t3]) ).
cnf(t110,plain,
efalse = eq(true,true),
inference(cp,[status(thm)],[t109,t16]) ).
cnf(t0,plain,
eq(X1,X1) = etrue,
introduced(definition) ).
cnf(t108,plain,
eq(X1,X1) = etrue,
inference(orient,[status(thm)],[t0]) ).
cnf(t114,plain,
efalse = etrue,
inference(step,[status(thm)],[t110,t108]) ).
cnf(t111,plain,
efalse = etrue,
inference(orient,[status(thm)],[t114]) ).
cnf(goal_0,negated_conjecture,
etrue != efalse,
introduced(definition) ).
cnf(g0_0,plain,
etrue != etrue,
inference(rw,[status(thm)],[goal_0,t111]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP028-4 : TPTP v9.3.1. Released v2.6.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.09/0.35 % Computer : n014.cluster.edu
% 0.09/0.35 % Model : x86_64 x86_64
% 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35 % Memory : 8046.5625MB
% 0.09/0.35 % OS : Linux 6.8.0-71-generic
% 0.09/0.35 % CPULimit : 300
% 0.09/0.35 % WCLimit : 300
% 0.09/0.35 % DateTime : Wed Sep 23 13:18:33 UTC 2026
% 0.09/0.35 % CPUTime :
% 0.09/0.35 Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 3.43/0.84 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.43/0.84 % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------