%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : SYN325-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:21 PM UTC 2026
% Result : Unsatisfiable 0.14s 11.02s
% Output : Proof 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 7
% Syntax : Number of formulae : 39 ( 31 unt; 0 def)
% Number of atoms : 47 ( 26 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 20 ( 12 ~; 8 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-4 aty)
% Number of variables : 35 ( 10 sgn 6 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
cnf(f4,negated_conjecture,
~ g(y(X)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause5) ).
fof(f4_nnf,plain,
! [X] : ~ g(y(X)),
inference(nnf_transformation,[status(thm)],[f4]) ).
fof(f4_sk,plain,
! [X] : ~ g(y(X)),
inference(skolemisation,[status(esa)],[f4_nnf]) ).
cnf(c4,plain,
~ g(y(X0)),
inference(cnf_transformation,[status(esa)],[f4_sk]) ).
cnf(t1,plain,
g(y(X1)) = false,
inference(equality_encoding,[status(esa)],[c4]) ).
cnf(t21,plain,
g(y(X1)) = false,
inference(orient,[status(thm)],[t1]) ).
cnf(f3,negated_conjecture,
( g(X)
| ~ f(y(X),y(X)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause4) ).
fof(f3_nnf,plain,
! [X] :
( g(X)
| ~ f(y(X),y(X)) ),
inference(nnf_transformation,[status(thm)],[f3]) ).
fof(f3_sk,plain,
! [X] :
( g(X)
| ~ f(y(X),y(X)) ),
inference(skolemisation,[status(esa)],[f3_nnf]) ).
cnf(c3,plain,
( g(X0)
| ~ f(y(X0),y(X0)) ),
inference(cnf_transformation,[status(esa)],[f3_sk]) ).
cnf(t10,plain,
ifeq(f(y(X1),y(X1)),true,g(X1),true) = true,
inference(equality_encoding,[status(esa)],[c3]) ).
cnf(t20,plain,
ifeq(f(y(X1),y(X1)),true,g(X1),true) = true,
inference(orient,[status(thm)],[t10]) ).
cnf(f1,negated_conjecture,
( g(X)
| f(X,X) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause2) ).
fof(f1_nnf,plain,
! [X] :
( g(X)
| f(X,X) ),
inference(nnf_transformation,[status(thm)],[f1]) ).
fof(f1_sk,plain,
! [X] :
( g(X)
| f(X,X) ),
inference(skolemisation,[status(esa)],[f1_nnf]) ).
cnf(c1,plain,
( g(X0)
| f(X0,X0) ),
inference(cnf_transformation,[status(esa)],[f1_sk]) ).
cnf(t8,plain,
or(f(X1,X1),g(X1)) = true,
inference(equality_encoding,[status(esa)],[c1]) ).
cnf(t18,plain,
or(f(X1,X1),g(X1)) = true,
inference(orient,[status(thm)],[t8]) ).
cnf(t22,plain,
true = or(f(y(X1),y(X1)),false),
inference(cp,[status(thm)],[t18,t21]) ).
cnf(t2,plain,
or(X1,false) = X1,
introduced(definition) ).
cnf(t12,plain,
or(X1,false) = X1,
inference(orient,[status(thm)],[t2]) ).
cnf(t36,plain,
true = f(y(X1),y(X1)),
inference(step,[status(thm)],[t22,t12]) ).
cnf(t26,plain,
f(y(X1),y(X1)) = true,
inference(orient,[status(thm)],[t36]) ).
cnf(t37,plain,
ifeq(true,true,g(X1),true) = true,
inference(step,[status(thm)],[t20,t26]) ).
cnf(t7,plain,
ifeq(X1,X1,X2,X3) = X2,
introduced(definition) ).
cnf(t14,plain,
ifeq(X1,X1,X2,X3) = X2,
inference(orient,[status(thm)],[t7]) ).
cnf(t38,plain,
g(X1) = true,
inference(step,[status(thm)],[t37,t14]) ).
cnf(t27,plain,
g(X1) = true,
inference(rw,[status(thm)],[t38]) ).
cnf(t29,plain,
g(X1) = true,
inference(orient,[status(thm)],[t27]) ).
cnf(t41,plain,
true = false,
inference(step,[status(thm)],[t21,t29]) ).
cnf(t30,plain,
true = false,
inference(rw,[status(thm)],[t41]) ).
cnf(t31,plain,
false = true,
inference(orient,[status(thm)],[t30]) ).
cnf(t0,plain,
eq(X1,X1) = etrue,
introduced(definition) ).
cnf(t24,plain,
eq(X1,X1) = etrue,
inference(orient,[status(thm)],[t0]) ).
cnf(goal_0,negated_conjecture,
etrue != efalse,
introduced(definition) ).
cnf(g0_0,plain,
eq(false,true) != efalse,
inference(rw,[status(thm)],[goal_0]) ).
cnf(g0_1,plain,
eq(false,false) != efalse,
inference(rw,[status(thm)],[g0_0,t31]) ).
cnf(g0_2,plain,
etrue != efalse,
inference(rw,[status(thm)],[g0_1,t24]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_2]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN325-1 : TPTP v9.3.1. Released v1.2.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.11/10.54 % Computer : n010.cluster.edu
% 0.11/10.54 % Model : x86_64 x86_64
% 0.11/10.54 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/10.54 % Memory : 8046.5625MB
% 0.11/10.54 % OS : Linux 6.8.0-71-generic
% 0.11/10.54 % CPULimit : 300
% 0.11/10.54 % WCLimit : 300
% 0.11/10.54 % DateTime : Fri Sep 25 00:51:09 UTC 2026
% 0.11/10.54 % CPUTime :
% 0.11/10.54 Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.14/11.02 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.14/11.02 % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------