%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : SYN290-1 : TPTP v9.3.1. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% Computer : n015.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:16 PM UTC 2026
% Result : Unsatisfiable 7.44s 1.44s
% Output : Proof 7.44s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 8
% Syntax : Number of formulae : 38 ( 34 unt; 0 def)
% Number of atoms : 54 ( 16 equ)
% Maximal formula atoms : 5 ( 1 avg)
% Number of connectives : 38 ( 22 ~; 16 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 2 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-4 aty)
% Number of variables : 39 ( 17 sgn 14 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
cnf(f368,negated_conjecture,
~ q1(c,X,Y),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
fof(f368_nnf,plain,
! [X,Y] : ~ q1(c,X,Y),
inference(nnf_transformation,[status(thm)],[f368]) ).
fof(f368_sk,plain,
! [X,Y] : ~ q1(c,X,Y),
inference(skolemisation,[status(esa)],[f368_nnf]) ).
cnf(c368,plain,
~ q1(c,X0,X1),
inference(cnf_transformation,[status(esa)],[f368_sk]) ).
cnf(t49,plain,
eq(q1(c,X1,X2),true) = efalse,
inference(equality_encoding,[status(esa)],[c368]) ).
cnf(t381,plain,
eq(q1(c,X1,X2),true) = efalse,
inference(orient,[status(thm)],[t49]) ).
cnf(f141,axiom,
( ~ q0(F,F)
| ~ p0(H,E)
| ~ r0(G)
| ~ l0(E)
| q1(E,F,E) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_104) ).
fof(f141_nnf,plain,
! [E,F,G,H] :
( ~ q0(F,F)
| ~ p0(H,E)
| ~ r0(G)
| ~ l0(E)
| q1(E,F,E) ),
inference(nnf_transformation,[status(thm)],[f141]) ).
fof(f141_sk,plain,
! [E,F,G,H] :
( ~ q0(F,F)
| ~ p0(H,E)
| ~ r0(G)
| ~ l0(E)
| q1(E,F,E) ),
inference(skolemisation,[status(esa)],[f141_nnf]) ).
cnf(c141,plain,
( ~ q0(X1,X1)
| ~ p0(X3,X0)
| ~ r0(X2)
| ~ l0(X0)
| q1(X0,X1,X0) ),
inference(cnf_transformation,[status(esa)],[f141_sk]) ).
cnf(hi139,axiom,
ifeq(l0(X0),true,ifeq(r0(X1),true,ifeq(p0(X2,X0),true,ifeq(q0(X3,X3),true,q1(X0,X3,X0),true),true),true),true) = true,
inference(equality_encoding,[status(esa)],[c141]) ).
cnf(f23,axiom,
l0(c),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_24) ).
fof(f23_nnf,plain,
l0(c),
inference(nnf_transformation,[status(thm)],[f23]) ).
cnf(c23,plain,
l0(c),
inference(cnf_transformation,[status(esa)],[f23_nnf]) ).
cnf(hi23,axiom,
l0(c) = true,
inference(equality_encoding,[status(esa)],[c23]) ).
cnf(f12,axiom,
r0(e),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_13) ).
fof(f12_nnf,plain,
r0(e),
inference(nnf_transformation,[status(thm)],[f12]) ).
cnf(c12,plain,
r0(e),
inference(cnf_transformation,[status(esa)],[f12_nnf]) ).
cnf(hi12,axiom,
r0(e) = true,
inference(equality_encoding,[status(esa)],[c12]) ).
cnf(f13,axiom,
p0(b,X),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_14) ).
fof(f13_nnf,plain,
! [X] : p0(b,X),
inference(nnf_transformation,[status(thm)],[f13]) ).
fof(f13_sk,plain,
! [X] : p0(b,X),
inference(skolemisation,[status(esa)],[f13_nnf]) ).
cnf(c13,plain,
p0(b,X0),
inference(cnf_transformation,[status(esa)],[f13_sk]) ).
cnf(hi13,axiom,
p0(b,X0) = true,
inference(equality_encoding,[status(esa)],[c13]) ).
cnf(f5,axiom,
q0(b,b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_6) ).
fof(f5_nnf,plain,
q0(b,b),
inference(nnf_transformation,[status(thm)],[f5]) ).
cnf(c5,plain,
q0(b,b),
inference(cnf_transformation,[status(esa)],[f5_nnf]) ).
cnf(hi5,axiom,
q0(b,b) = true,
inference(equality_encoding,[status(esa)],[c5]) ).
cnf(t41,plain,
q1(c,b,c) = true,
inference(hyper_resolution,[status(thm)],[hi139,hi23,hi12,hi13,hi5]) ).
cnf(t303,plain,
q1(c,b,c) = true,
inference(orient,[status(thm)],[t41]) ).
cnf(t382,plain,
efalse = eq(true,true),
inference(cp,[status(thm)],[t381,t303]) ).
cnf(t0,plain,
eq(X1,X1) = etrue,
introduced(definition) ).
cnf(t380,plain,
eq(X1,X1) = etrue,
inference(orient,[status(thm)],[t0]) ).
cnf(t392,plain,
efalse = etrue,
inference(step,[status(thm)],[t382,t380]) ).
cnf(t383,plain,
efalse = etrue,
inference(orient,[status(thm)],[t392]) ).
cnf(goal_0,negated_conjecture,
etrue != efalse,
introduced(definition) ).
cnf(g0_0,plain,
etrue != etrue,
inference(rw,[status(thm)],[goal_0,t383]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN290-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.10/0.37 % Computer : n015.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Fri Sep 25 00:47:26 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 7.44/1.44 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 7.44/1.44 % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------