%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : SYN340-1 : TPTP v9.3.1. Released v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% Computer : n026.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:25 PM UTC 2026
% Result : Unsatisfiable 5.46s 11.34s
% Output : Proof 5.46s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 4
% Syntax : Number of formulae : 20 ( 20 unt; 0 def)
% Number of atoms : 20 ( 11 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 6 ( 6 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-5 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 38 ( 8 sgn 12 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
cnf(f1,negated_conjecture,
~ f(Z1,X,y(X),Z1,Z2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause2) ).
fof(f1_nnf,plain,
! [Z1,X,Z2] : ~ f(Z1,X,y(X),Z1,Z2),
inference(nnf_transformation,[status(thm)],[f1]) ).
fof(f1_sk,plain,
! [Z1,X,Z2] : ~ f(Z1,X,y(X),Z1,Z2),
inference(skolemisation,[status(esa)],[f1_nnf]) ).
cnf(c1,plain,
~ f(X0,X1,y(X1),X0,X2),
inference(cnf_transformation,[status(esa)],[f1_sk]) ).
cnf(t2,plain,
eq(f(X1,X2,y(X2),X1,X3),true) = efalse,
inference(equality_encoding,[status(esa)],[c1]) ).
cnf(t5,plain,
eq(f(X1,X2,y(X2),X1,X3),true) = efalse,
inference(orient,[status(thm)],[t2]) ).
cnf(f0,negated_conjecture,
f(X,y(X),Z1,Z2,Z1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause1) ).
fof(f0_nnf,plain,
! [X,Z1,Z2] : f(X,y(X),Z1,Z2,Z1),
inference(nnf_transformation,[status(thm)],[f0]) ).
fof(f0_sk,plain,
! [X,Z1,Z2] : f(X,y(X),Z1,Z2,Z1),
inference(skolemisation,[status(esa)],[f0_nnf]) ).
cnf(c0,plain,
f(X0,y(X0),X1,X2,X1),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(t1,plain,
f(X1,y(X1),X2,X3,X2) = true,
inference(equality_encoding,[status(esa)],[c0]) ).
cnf(t3,plain,
f(X1,y(X1),X2,X3,X2) = true,
inference(orient,[status(thm)],[t1]) ).
cnf(t6,plain,
efalse = eq(true,true),
inference(cp,[status(thm)],[t5,t3]) ).
cnf(t0,plain,
eq(X1,X1) = etrue,
introduced(definition) ).
cnf(t4,plain,
eq(X1,X1) = etrue,
inference(orient,[status(thm)],[t0]) ).
cnf(t10,plain,
efalse = etrue,
inference(step,[status(thm)],[t6,t4]) ).
cnf(t7,plain,
efalse = etrue,
inference(orient,[status(thm)],[t10]) ).
cnf(goal_0,negated_conjecture,
etrue != efalse,
introduced(definition) ).
cnf(g0_0,plain,
etrue != etrue,
inference(rw,[status(thm)],[goal_0,t7]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYN340-1 : TPTP v9.3.1. Released v1.2.0.
% 0.00/0.03 % Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.09/10.58 % Computer : n026.cluster.edu
% 0.09/10.58 % Model : x86_64 x86_64
% 0.09/10.58 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/10.58 % Memory : 8046.5625MB
% 0.09/10.58 % OS : Linux 6.8.0-71-generic
% 0.09/10.58 % CPULimit : 300
% 0.09/10.58 % WCLimit : 300
% 0.09/10.58 % DateTime : Fri Sep 25 00:57:37 UTC 2026
% 0.09/10.58 % CPUTime :
% 0.09/10.58 Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 5.46/11.34 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 5.46/11.34 % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------