%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : GRP003-2 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox/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:24:53 PM UTC 2026
% Result : Unsatisfiable 4.00s 1.15s
% Output : Proof 4.00s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 5
% Syntax : Number of formulae : 31 ( 23 unt; 0 def)
% Number of atoms : 55 ( 10 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 54 ( 30 ~; 24 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-4 aty)
% Number of variables : 73 ( 0 sgn 28 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
cnf(f4,axiom,
( product(X,V,W)
| ~ product(U,Z,W)
| ~ product(Y,Z,V)
| ~ product(X,Y,U) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',associativity1) ).
fof(f4_nnf,plain,
! [X,Y,U,Z,V,W] :
( product(X,V,W)
| ~ product(U,Z,W)
| ~ product(Y,Z,V)
| ~ product(X,Y,U) ),
inference(nnf_transformation,[status(thm)],[f4]) ).
fof(f4_sk,plain,
! [X,Y,U,Z,V,W] :
( product(X,V,W)
| ~ product(U,Z,W)
| ~ product(Y,Z,V)
| ~ product(X,Y,U) ),
inference(skolemisation,[status(esa)],[f4_nnf]) ).
cnf(c4,plain,
( product(X0,X4,X5)
| ~ product(X2,X3,X5)
| ~ product(X1,X3,X4)
| ~ product(X0,X1,X2) ),
inference(cnf_transformation,[status(esa)],[f4_sk]) ).
cnf(hi4,axiom,
ifeq(product(X0,X1,X2),true,ifeq(product(X1,X3,X4),true,ifeq(product(X2,X3,X5),true,product(X0,X4,X5),true),true),true) = true,
inference(equality_encoding,[status(esa)],[c4]) ).
cnf(f1,axiom,
product(inverse(X),X,identity),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',left_inverse) ).
fof(f1_nnf,plain,
! [X] : product(inverse(X),X,identity),
inference(nnf_transformation,[status(thm)],[f1]) ).
fof(f1_sk,plain,
! [X] : product(inverse(X),X,identity),
inference(skolemisation,[status(esa)],[f1_nnf]) ).
cnf(c1,plain,
product(inverse(X0),X0,identity),
inference(cnf_transformation,[status(esa)],[f1_sk]) ).
cnf(hi1,axiom,
product(inverse(X0),X0,identity) = true,
inference(equality_encoding,[status(esa)],[c1]) ).
cnf(f0,axiom,
product(identity,X,X),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',left_identity) ).
fof(f0_nnf,plain,
! [X] : product(identity,X,X),
inference(nnf_transformation,[status(thm)],[f0]) ).
fof(f0_sk,plain,
! [X] : product(identity,X,X),
inference(skolemisation,[status(esa)],[f0_nnf]) ).
cnf(c0,plain,
product(identity,X0,X0),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(hi0,axiom,
product(identity,X0,X0) = true,
inference(equality_encoding,[status(esa)],[c0]) ).
cnf(h2,plain,
product(inverse(inverse(V0)),identity,V0) = true,
inference(hyper_resolution,[status(thm)],[hi4,hi1,hi1,hi0]) ).
cnf(f5,axiom,
( product(U,Z,W)
| ~ product(X,V,W)
| ~ product(Y,Z,V)
| ~ product(X,Y,U) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',associativity2) ).
fof(f5_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)],[f5]) ).
fof(f5_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)],[f5_nnf]) ).
cnf(c5,plain,
( product(X2,X3,X5)
| ~ product(X0,X4,X5)
| ~ product(X1,X3,X4)
| ~ product(X0,X1,X2) ),
inference(cnf_transformation,[status(esa)],[f5_sk]) ).
cnf(hi5,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)],[c5]) ).
cnf(h1,plain,
product(identity,identity,identity) = true,
inference(hyper_resolution,[status(thm)],[hi5,hi1,hi0,hi1]) ).
cnf(t2,plain,
product(X1,identity,X1) = true,
inference(hyper_resolution,[status(thm)],[hi5,h2,h1,h2]) ).
cnf(t64,plain,
product(X1,identity,X1) = true,
inference(orient,[status(thm)],[t2]) ).
cnf(f7,negated_conjecture,
~ product(a,identity,a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_right_identity) ).
fof(f7_nnf,plain,
~ product(a,identity,a),
inference(nnf_transformation,[status(thm)],[f7]) ).
fof(f7_sk,plain,
~ product(a,identity,a),
inference(skolemisation,[status(esa)],[f7_nnf]) ).
cnf(c7,plain,
~ product(a,identity,a),
inference(cnf_transformation,[status(esa)],[f7_sk]) ).
cnf(goal_0,negated_conjecture,
product(a,identity,a) != true,
inference(equality_encoding,[status(esa)],[c7]) ).
cnf(g0_0,plain,
true != true,
inference(rw,[status(thm)],[goal_0,t64]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GRP003-2 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.03 % Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.07/0.34 % Computer : n016.cluster.edu
% 0.07/0.34 % Model : x86_64 x86_64
% 0.07/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.34 % Memory : 8046.5625MB
% 0.07/0.34 % OS : Linux 6.8.0-71-generic
% 0.07/0.35 % CPULimit : 300
% 0.07/0.35 % WCLimit : 300
% 0.07/0.35 % DateTime : Wed Sep 23 13:16:40 UTC 2026
% 0.07/0.35 % CPUTime :
% 0.07/0.35 Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 4.00/1.15 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.00/1.15 % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------