%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : SYN333-1 : TPTP v9.3.1. Released v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% Computer : n010.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 03:34:23 PM UTC 2026
% Result : Unsatisfiable 4.77s 1.37s
% Output : Proof 4.77s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 4
% Syntax : Number of formulae : 39 ( 31 unt; 0 def)
% Number of atoms : 59 ( 26 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 46 ( 26 ~; 20 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 2 avg)
% Maximal term depth : 6 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-4 aty)
% Number of variables : 68 ( 18 sgn 12 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
cnf(f2,negated_conjecture,
( ~ g(z(X,Y),z(X,Y))
| ~ g(X,z(X,Y))
| ~ f(z(X,Y),z(X,Y))
| ~ f(Y,z(X,Y)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause3) ).
fof(f2_nnf,plain,
! [Y,X] :
( ~ g(z(X,Y),z(X,Y))
| ~ g(X,z(X,Y))
| ~ f(z(X,Y),z(X,Y))
| ~ f(Y,z(X,Y)) ),
inference(nnf_transformation,[status(thm)],[f2]) ).
fof(f2_sk,plain,
! [Y,X] :
( ~ g(z(X,Y),z(X,Y))
| ~ g(X,z(X,Y))
| ~ f(z(X,Y),z(X,Y))
| ~ f(Y,z(X,Y)) ),
inference(skolemisation,[status(esa)],[f2_nnf]) ).
cnf(c2,plain,
( ~ g(z(X1,X0),z(X1,X0))
| ~ g(X1,z(X1,X0))
| ~ f(z(X1,X0),z(X1,X0))
| ~ f(X0,z(X1,X0)) ),
inference(cnf_transformation,[status(esa)],[f2_sk]) ).
cnf(t3,plain,
ifeq(f(X1,z(X2,X1)),true,ifeq(f(z(X2,X1),z(X2,X1)),true,ifeq(g(X2,z(X2,X1)),true,ifeq(g(z(X2,X1),z(X2,X1)),true,false,true),true),true),true) = true,
inference(equality_encoding,[status(esa)],[c2]) ).
cnf(t5,plain,
ifeq(f(X1,z(X2,X1)),true,ifeq(f(z(X2,X1),z(X2,X1)),true,ifeq(g(X2,z(X2,X1)),true,ifeq(g(z(X2,X1),z(X2,X1)),true,false,true),true),true),true) = true,
inference(orient,[status(thm)],[t3]) ).
cnf(f0,negated_conjecture,
f(X,Y),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause1) ).
fof(f0_nnf,plain,
! [X,Y] : f(X,Y),
inference(nnf_transformation,[status(thm)],[f0]) ).
fof(f0_sk,plain,
! [X,Y] : f(X,Y),
inference(skolemisation,[status(esa)],[f0_nnf]) ).
cnf(c0,plain,
f(X0,X1),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(t0,plain,
f(X1,X2) = true,
inference(equality_encoding,[status(esa)],[c0]) ).
cnf(t7,plain,
f(X1,X2) = true,
inference(orient,[status(thm)],[t0]) ).
cnf(t16,plain,
ifeq(true,true,ifeq(f(z(X2,X1),z(X2,X1)),true,ifeq(g(X2,z(X2,X1)),true,ifeq(g(z(X2,X1),z(X2,X1)),true,false,true),true),true),true) = true,
inference(step,[status(thm)],[t5,t7]) ).
cnf(t1,plain,
ifeq(X1,X1,X2,X3) = X2,
introduced(definition) ).
cnf(t4,plain,
ifeq(X1,X1,X2,X3) = X2,
inference(orient,[status(thm)],[t1]) ).
cnf(t17,plain,
ifeq(f(z(X2,X1),z(X2,X1)),true,ifeq(g(X2,z(X2,X1)),true,ifeq(g(z(X2,X1),z(X2,X1)),true,false,true),true),true) = true,
inference(step,[status(thm)],[t16,t4]) ).
cnf(t18,plain,
ifeq(true,true,ifeq(g(X2,z(X2,X1)),true,ifeq(g(z(X2,X1),z(X2,X1)),true,false,true),true),true) = true,
inference(step,[status(thm)],[t17,t7]) ).
cnf(t19,plain,
ifeq(g(X2,z(X2,X1)),true,ifeq(g(z(X2,X1),z(X2,X1)),true,false,true),true) = true,
inference(step,[status(thm)],[t18,t4]) ).
cnf(t9,plain,
ifeq(g(X2,z(X2,X1)),true,ifeq(g(z(X2,X1),z(X2,X1)),true,false,true),true) = true,
inference(rw,[status(thm)],[t19]) ).
cnf(f1,negated_conjecture,
( g(X,Y)
| ~ f(z(X,Y),z(X,Y))
| ~ f(Y,z(X,Y)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause2) ).
fof(f1_nnf,plain,
! [Y,X] :
( g(X,Y)
| ~ f(z(X,Y),z(X,Y))
| ~ f(Y,z(X,Y)) ),
inference(nnf_transformation,[status(thm)],[f1]) ).
fof(f1_sk,plain,
! [Y,X] :
( g(X,Y)
| ~ f(z(X,Y),z(X,Y))
| ~ f(Y,z(X,Y)) ),
inference(skolemisation,[status(esa)],[f1_nnf]) ).
cnf(c1,plain,
( g(X1,X0)
| ~ f(z(X1,X0),z(X1,X0))
| ~ f(X0,z(X1,X0)) ),
inference(cnf_transformation,[status(esa)],[f1_sk]) ).
cnf(t2,plain,
ifeq(f(X1,z(X2,X1)),true,ifeq(f(z(X2,X1),z(X2,X1)),true,g(X2,X1),true),true) = true,
inference(equality_encoding,[status(esa)],[c1]) ).
cnf(t6,plain,
ifeq(f(X1,z(X2,X1)),true,ifeq(f(z(X2,X1),z(X2,X1)),true,g(X2,X1),true),true) = true,
inference(orient,[status(thm)],[t2]) ).
cnf(t12,plain,
ifeq(true,true,ifeq(f(z(X2,X1),z(X2,X1)),true,g(X2,X1),true),true) = true,
inference(step,[status(thm)],[t6,t7]) ).
cnf(t13,plain,
ifeq(f(z(X2,X1),z(X2,X1)),true,g(X2,X1),true) = true,
inference(step,[status(thm)],[t12,t4]) ).
cnf(t14,plain,
ifeq(true,true,g(X2,X1),true) = true,
inference(step,[status(thm)],[t13,t7]) ).
cnf(t15,plain,
g(X2,X1) = true,
inference(step,[status(thm)],[t14,t4]) ).
cnf(t8,plain,
g(X2,X1) = true,
inference(rw,[status(thm)],[t15]) ).
cnf(t10,plain,
g(X1,X2) = true,
inference(orient,[status(thm)],[t8]) ).
cnf(t20,plain,
ifeq(true,true,ifeq(g(z(X2,X1),z(X2,X1)),true,false,true),true) = true,
inference(step,[status(thm)],[t9,t10]) ).
cnf(t21,plain,
ifeq(g(z(X2,X1),z(X2,X1)),true,false,true) = true,
inference(step,[status(thm)],[t20,t4]) ).
cnf(t22,plain,
ifeq(true,true,false,true) = true,
inference(step,[status(thm)],[t21,t10]) ).
cnf(t23,plain,
false = true,
inference(step,[status(thm)],[t22,t4]) ).
cnf(t11,plain,
false = true,
inference(orient,[status(thm)],[t23]) ).
cnf(goal_0,negated_conjecture,
true != false,
inference(equality_encoding,[status(esa)],[c2]) ).
cnf(g0_0,plain,
true != true,
inference(rw,[status(thm)],[goal_0,t11]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN333-1 : TPTP v9.3.1. Released v1.2.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.10/0.52 % Computer : n010.cluster.edu
% 0.10/0.52 % Model : x86_64 x86_64
% 0.10/0.52 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.52 % Memory : 8046.5625MB
% 0.10/0.52 % OS : Linux 6.8.0-71-generic
% 0.10/0.52 % CPULimit : 300
% 0.10/0.52 % WCLimit : 300
% 0.10/0.52 % DateTime : Fri Sep 25 00:52:59 UTC 2026
% 0.10/0.53 % CPUTime :
% 0.10/0.53 Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 4.77/1.37 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.77/1.37 % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------