%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : PUZ001+2 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% Computer : n016.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 02:31:47 PM UTC 2026
% Result : Theorem 2.44s 0.77s
% Output : Proof 2.44s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 2
% Syntax : Number of formulae : 51 ( 20 unt; 0 def)
% Number of atoms : 213 ( 56 equ)
% Maximal formula atoms : 37 ( 4 avg)
% Number of connectives : 260 ( 98 ~; 98 |; 54 &)
% ( 0 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 36 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 4 usr; 2 prp; 0-4 aty)
% Number of functors : 19 ( 19 usr; 13 con; 0-3 aty)
% Number of variables : 129 ( 11 sgn 54 !; 25 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f0,axiom,
? [A,B,C] :
( qtd1 != qtd2
& ! [Z] :
( $true
=> ~ ! [A1] :
( $true
=> ? [B1] : predicate2(B1,hate,Z,A1) ) )
& ! [W,X] :
( ( predicate2(X,hate,qtd1,W)
& $true )
=> ? [Y] : predicate2(Y,hate,qtd2,W) )
& ! [T] :
( ( ~ ? [U] :
( T = U
& property2(U,rich,comp_than,qtd1) )
& $true )
=> ? [V] : predicate2(V,hate,qtd2,T) )
& ! [R] :
( ( R != qtd2
& $true )
=> ? [S] : predicate2(S,hate,qtd1,R) )
& ~ ? [Q] : predicate2(Q,hate,qtd1,qtd2)
& ! [N,O] :
( ( predicate2(O,hate,qtd1,N)
& $true )
=> ~ ? [P] : predicate2(P,hate,qtd3,N) )
& ! [J] :
( $true
=> ~ ? [K,L,M] :
( J = M
& property2(M,rich,comp_than,K)
& predicate2(L,kill,J,K)
& $true ) )
& ! [F] :
( $true
=> ! [G,H] :
( ( predicate2(H,kill,F,G)
& $true )
=> ? [I] : predicate2(I,hate,F,G) ) )
& ! [D,E] :
( ( modifier_pp(E,in,qtd0)
& predicate1(E,live,D)
& $true )
=> ( D = qtd3
| D = qtd2
| D = qtd1 ) )
& predicate2(C,kill,A,qtd1)
& modifier_pp(B,in,qtd0)
& predicate1(B,live,A)
& $true ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',background) ).
fof(f0_nnf,plain,
? [A,B,C] :
( qtd1 != qtd2
& ! [Z] :
( ? [A1] :
( ! [B1] : ~ predicate2(B1,hate,Z,A1)
& $true )
| ~ $true )
& ! [W,X] :
( ? [Y] : predicate2(Y,hate,qtd2,W)
| ~ predicate2(X,hate,qtd1,W)
| ~ $true )
& ! [T] :
( ? [V] : predicate2(V,hate,qtd2,T)
| ? [U] :
( T = U
& property2(U,rich,comp_than,qtd1) )
| ~ $true )
& ! [R] :
( ? [S] : predicate2(S,hate,qtd1,R)
| R = qtd2
| ~ $true )
& ! [Q] : ~ predicate2(Q,hate,qtd1,qtd2)
& ! [N,O] :
( ! [P] : ~ predicate2(P,hate,qtd3,N)
| ~ predicate2(O,hate,qtd1,N)
| ~ $true )
& ! [J] :
( ! [K,L,M] :
( J != M
| ~ property2(M,rich,comp_than,K)
| ~ predicate2(L,kill,J,K)
| ~ $true )
| ~ $true )
& ! [F] :
( ! [G,H] :
( ? [I] : predicate2(I,hate,F,G)
| ~ predicate2(H,kill,F,G)
| ~ $true )
| ~ $true )
& ! [D,E] :
( D = qtd3
| D = qtd2
| D = qtd1
| ~ modifier_pp(E,in,qtd0)
| ~ predicate1(E,live,D)
| ~ $true )
& predicate2(C,kill,A,qtd1)
& modifier_pp(B,in,qtd0)
& predicate1(B,live,A)
& $true ),
inference(nnf_transformation,[status(thm)],[f0]) ).
fof(f0_sk,plain,
! [E,D,H,F,G,L,J,K,M,O,N,P,Q,R,T,X,W,B1,Z] :
( qtd1 != qtd2
& ( ( ~ predicate2(B1,hate,Z,sk8(Z))
& $true )
| ~ $true )
& ( predicate2(sk7(W,X),hate,qtd2,W)
| ~ predicate2(X,hate,qtd1,W)
| ~ $true )
& ( predicate2(sk6(T),hate,qtd2,T)
| ( T = sk5(T)
& property2(sk5(T),rich,comp_than,qtd1) )
| ~ $true )
& ( predicate2(sk4(R),hate,qtd1,R)
| R = qtd2
| ~ $true )
& ~ predicate2(Q,hate,qtd1,qtd2)
& ( ~ predicate2(P,hate,qtd3,N)
| ~ predicate2(O,hate,qtd1,N)
| ~ $true )
& ( J != M
| ~ property2(M,rich,comp_than,K)
| ~ predicate2(L,kill,J,K)
| ~ $true
| ~ $true )
& ( predicate2(sk3(F,G,H),hate,F,G)
| ~ predicate2(H,kill,F,G)
| ~ $true
| ~ $true )
& ( D = qtd3
| D = qtd2
| D = qtd1
| ~ modifier_pp(E,in,qtd0)
| ~ predicate1(E,live,D)
| ~ $true )
& predicate2(sk2,kill,sk0,qtd1)
& modifier_pp(sk1,in,qtd0)
& predicate1(sk1,live,sk0)
& $true ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sk0,sk1,sk2,sk3,sk4,sk5,sk6,sk7,sk8])],[f0_nnf]) ).
cnf(c4,plain,
( X3 = qtd3
| X3 = qtd2
| X3 = qtd1
| ~ modifier_pp(X4,in,qtd0)
| ~ predicate1(X4,live,X3)
| ~ $true ),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(c0,plain,
$true,
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(p23,plain,
( X1 = qtd3
| X1 = qtd2
| X1 = qtd1
| ~ modifier_pp(X0,in,qtd0)
| ~ predicate1(X0,live,X1) ),
inference(resolution,[status(thm)],[c4,c0]) ).
cnf(c1,plain,
predicate1(sk1,live,sk0),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(p64,plain,
( sk0 = qtd3
| sk0 = qtd2
| sk0 = qtd1
| ~ modifier_pp(sk1,in,qtd0) ),
inference(resolution,[status(thm)],[p23,c1]) ).
cnf(c2,plain,
modifier_pp(sk1,in,qtd0),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(p70,plain,
( sk0 = qtd3
| sk0 = qtd2
| sk0 = qtd1 ),
inference(resolution,[status(thm)],[p64,c2]) ).
cnf(c5,plain,
( predicate2(sk3(X5,X6,X7),hate,X5,X6)
| ~ predicate2(X7,kill,X5,X6)
| ~ $true
| ~ $true ),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(p26,plain,
( predicate2(sk3(X1,X2,X0),hate,X1,X2)
| ~ predicate2(X0,kill,X1,X2)
| ~ $true ),
inference(factoring,[status(thm)],[c5]) ).
cnf(p48,plain,
( predicate2(sk3(X1,X2,X0),hate,X1,X2)
| ~ predicate2(X0,kill,X1,X2) ),
inference(resolution,[status(thm)],[p26,c0]) ).
cnf(c3,plain,
predicate2(sk2,kill,sk0,qtd1),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(p49,plain,
predicate2(sk3(sk0,qtd1,sk2),hate,sk0,qtd1),
inference(resolution,[status(thm)],[p48,c3]) ).
cnf(p79,plain,
( predicate2(sk3(sk0,qtd1,sk2),hate,qtd3,qtd1)
| sk0 = qtd2
| sk0 = qtd1 ),
inference(superposition,[status(thm)],[p70,p49]) ).
cnf(c7,plain,
( ~ predicate2(X15,hate,qtd3,X13)
| ~ predicate2(X14,hate,qtd1,X13)
| ~ $true ),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(p27,plain,
( ~ predicate2(X2,hate,qtd3,X1)
| ~ predicate2(X0,hate,qtd1,X1) ),
inference(resolution,[status(thm)],[c7,c0]) ).
cnf(c9,plain,
( predicate2(sk4(X17),hate,qtd1,X17)
| X17 = qtd2
| ~ $true ),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(p24,plain,
( predicate2(sk4(X0),hate,qtd1,X0)
| X0 = qtd2 ),
inference(resolution,[status(thm)],[c9,c0]) ).
cnf(p28,plain,
( X1 = qtd2
| ~ predicate2(X0,hate,qtd3,X1) ),
inference(resolution,[status(thm)],[p27,p24]) ).
cnf(p102,plain,
( qtd1 = qtd2
| sk0 = qtd2
| sk0 = qtd1 ),
inference(resolution,[status(thm)],[p79,p28]) ).
cnf(c6,plain,
( X9 != X12
| ~ property2(X12,rich,comp_than,X10)
| ~ predicate2(X11,kill,X9,X10)
| ~ $true
| ~ $true ),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(p30,plain,
( X1 != X3
| ~ property2(X3,rich,comp_than,X2)
| ~ predicate2(X0,kill,X1,X2)
| ~ $true ),
inference(factoring,[status(thm)],[c6]) ).
cnf(p52,plain,
( X1 != X3
| ~ property2(X3,rich,comp_than,X2)
| ~ predicate2(X0,kill,X1,X2) ),
inference(resolution,[status(thm)],[p30,c0]) ).
cnf(p58,plain,
( sk0 != X0
| ~ property2(X0,rich,comp_than,qtd1) ),
inference(resolution,[status(thm)],[p52,c3]) ).
cnf(c12,plain,
( predicate2(sk7(X22,X23),hate,qtd2,X22)
| ~ predicate2(X23,hate,qtd1,X22)
| ~ $true ),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(p35,plain,
( predicate2(sk7(X1,X0),hate,qtd2,X1)
| ~ predicate2(X0,hate,qtd1,X1) ),
inference(resolution,[status(thm)],[c12,c0]) ).
cnf(p37,plain,
( X0 = qtd2
| predicate2(sk7(X0,sk4(X0)),hate,qtd2,X0) ),
inference(resolution,[status(thm)],[p35,p24]) ).
cnf(c14,plain,
( ~ predicate2(X27,hate,X25,sk8(X25))
| ~ $true ),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(p17,plain,
~ predicate2(X0,hate,X1,sk8(X1)),
inference(resolution,[status(thm)],[c14,c0]) ).
cnf(p38,plain,
sk8(qtd2) = qtd2,
inference(resolution,[status(thm)],[p37,p17]) ).
cnf(c11,plain,
( predicate2(sk6(X19),hate,qtd2,X19)
| X19 = sk5(X19)
| ~ $true ),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(p29,plain,
( predicate2(sk6(X0),hate,qtd2,X0)
| X0 = sk5(X0) ),
inference(resolution,[status(thm)],[c11,c0]) ).
cnf(p31,plain,
sk8(qtd2) = sk5(sk8(qtd2)),
inference(resolution,[status(thm)],[p29,p17]) ).
cnf(c10,plain,
( predicate2(sk6(X19),hate,qtd2,X19)
| property2(sk5(X19),rich,comp_than,qtd1)
| ~ $true ),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(p32,plain,
( predicate2(sk6(X0),hate,qtd2,X0)
| property2(sk5(X0),rich,comp_than,qtd1) ),
inference(resolution,[status(thm)],[c10,c0]) ).
cnf(p33,plain,
property2(sk5(sk8(qtd2)),rich,comp_than,qtd1),
inference(resolution,[status(thm)],[p32,p17]) ).
cnf(p36,plain,
property2(sk8(qtd2),rich,comp_than,qtd1),
inference(superposition,[status(thm)],[p31,p33]) ).
cnf(p41,plain,
property2(qtd2,rich,comp_than,qtd1),
inference(demodulation,[status(thm)],[p38,p36]) ).
cnf(p60,plain,
sk0 != qtd2,
inference(resolution,[status(thm)],[p58,p41]) ).
cnf(p109,plain,
( qtd1 = qtd2
| sk0 = qtd1 ),
inference(resolution,[status(thm)],[p102,p60]) ).
cnf(p112,plain,
( predicate2(sk2,kill,qtd1,qtd1)
| qtd1 = qtd2 ),
inference(superposition,[status(thm)],[p109,c3]) ).
fof(f1,conjecture,
? [A] : predicate2(A,kill,qtd1,qtd1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove) ).
fof(f1_neg,negated_conjecture,
~ ? [A] : predicate2(A,kill,qtd1,qtd1),
inference(negated_conjecture,[status(cth)],[f1]) ).
fof(f1_nnf,plain,
! [A] : ~ predicate2(A,kill,qtd1,qtd1),
inference(nnf_transformation,[status(thm)],[f1_neg]) ).
fof(f1_sk,plain,
! [A] : ~ predicate2(A,kill,qtd1,qtd1),
inference(skolemisation,[status(esa)],[f1_nnf]) ).
cnf(c16,plain,
~ predicate2(X0,kill,qtd1,qtd1),
inference(cnf_transformation,[status(esa)],[f1_sk]) ).
cnf(p119,plain,
qtd1 = qtd2,
inference(resolution,[status(thm)],[p112,c16]) ).
cnf(c15,plain,
qtd1 != qtd2,
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(p121,plain,
$false,
inference(resolution,[status(thm)],[p119,c15]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : PUZ001+2 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.09/0.36 % Computer : n016.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Thu Sep 24 06:40:27 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 2.44/0.77 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.44/0.77 % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------