%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : GRP042-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 : n003.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:25:02 PM UTC 2026
% Result : Unsatisfiable 4.79s 1.21s
% Output : Proof 4.79s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 5
% Syntax : Number of formulae : 29 ( 21 unt; 0 def)
% Number of atoms : 45 ( 9 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 38 ( 22 ~; 16 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-4 aty)
% Number of variables : 45 ( 0 sgn 18 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
cnf(f6,axiom,
( product(W,Z,Y)
| ~ product(W,Z,X)
| ~ equalish(X,Y) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',product_substitution3) ).
fof(f6_nnf,plain,
! [X,Y,W,Z] :
( product(W,Z,Y)
| ~ product(W,Z,X)
| ~ equalish(X,Y) ),
inference(nnf_transformation,[status(thm)],[f6]) ).
fof(f6_sk,plain,
! [X,Y,W,Z] :
( product(W,Z,Y)
| ~ product(W,Z,X)
| ~ equalish(X,Y) ),
inference(skolemisation,[status(esa)],[f6_nnf]) ).
cnf(c6,plain,
( product(X2,X3,X1)
| ~ product(X2,X3,X0)
| ~ equalish(X0,X1) ),
inference(cnf_transformation,[status(esa)],[f6_sk]) ).
cnf(hi6,axiom,
ifeq(equalish(X0,X1),true,ifeq(product(X2,X3,X0),true,product(X2,X3,X1),true),true) = true,
inference(equality_encoding,[status(esa)],[c6]) ).
cnf(f7,hypothesis,
equalish(a,b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_equals_b) ).
fof(f7_nnf,plain,
equalish(a,b),
inference(nnf_transformation,[status(thm)],[f7]) ).
cnf(c7,plain,
equalish(a,b),
inference(cnf_transformation,[status(esa)],[f7_nnf]) ).
cnf(hi7,axiom,
equalish(a,b) = true,
inference(equality_encoding,[status(esa)],[c7]) ).
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(h0,plain,
product(identity,a,b) = true,
inference(hyper_resolution,[status(thm)],[hi6,hi7,hi0]) ).
cnf(f3,axiom,
( equalish(Z,W)
| ~ product(X,Y,W)
| ~ product(X,Y,Z) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',total_function2) ).
fof(f3_nnf,plain,
! [X,Y,Z,W] :
( equalish(Z,W)
| ~ product(X,Y,W)
| ~ product(X,Y,Z) ),
inference(nnf_transformation,[status(thm)],[f3]) ).
fof(f3_sk,plain,
! [X,Y,Z,W] :
( equalish(Z,W)
| ~ product(X,Y,W)
| ~ product(X,Y,Z) ),
inference(skolemisation,[status(esa)],[f3_nnf]) ).
cnf(c3,plain,
( equalish(X2,X3)
| ~ product(X0,X1,X3)
| ~ product(X0,X1,X2) ),
inference(cnf_transformation,[status(esa)],[f3_sk]) ).
cnf(hi3,axiom,
ifeq(product(X0,X1,X2),true,ifeq(product(X0,X1,X3),true,equalish(X2,X3),true),true) = true,
inference(equality_encoding,[status(esa)],[c3]) ).
cnf(t2,plain,
equalish(b,a) = true,
inference(hyper_resolution,[status(thm)],[hi3,h0,hi0]) ).
cnf(t124,plain,
equalish(b,a) = true,
inference(orient,[status(thm)],[t2]) ).
cnf(f8,negated_conjecture,
~ equalish(b,a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_symmetry) ).
fof(f8_nnf,plain,
~ equalish(b,a),
inference(nnf_transformation,[status(thm)],[f8]) ).
fof(f8_sk,plain,
~ equalish(b,a),
inference(skolemisation,[status(esa)],[f8_nnf]) ).
cnf(c8,plain,
~ equalish(b,a),
inference(cnf_transformation,[status(esa)],[f8_sk]) ).
cnf(goal_0,negated_conjecture,
equalish(b,a) != true,
inference(equality_encoding,[status(esa)],[c8]) ).
cnf(g0_0,plain,
true != true,
inference(rw,[status(thm)],[goal_0,t124]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GRP042-2 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.03 % Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.08/0.35 % Computer : n003.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 13:24:04 UTC 2026
% 0.08/0.35 % CPUTime :
% 0.08/0.35 Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 4.79/1.21 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.79/1.21 % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------