%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : PUZ129+2 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 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 : Thu Sep 24 02:00:08 PM UTC 2026
% Result : Theorem 0.08s 0.38s
% Output : CNFRefutation 0.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 1
% Syntax : Number of formulae : 38 ( 14 unt; 0 def)
% Number of atoms : 209 ( 53 equ)
% Maximal formula atoms : 36 ( 5 avg)
% Number of connectives : 258 ( 87 ~; 67 |; 82 &)
% ( 0 <=>; 22 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 14 ( 14 usr; 8 con; 0-1 aty)
% Number of variables : 83 ( 55 !; 28 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
( ( ! [Q] :
( cyclist(Q)
=> ? [R] :
( Q = R
& person(R) ) )
& ! [O] :
( grocer(O)
=> ? [P] :
( O = P
& person(P) ) )
& ! [M] :
( ( property1(M,honest,pos)
& person(M) )
=> ~ ? [N] :
( M = N
& property1(N,dishonest,pos) ) )
& ! [K] :
( ( property1(K,healthy,pos)
& person(K) )
=> ~ ? [L] :
( K = L
& property1(L,unhealthy,pos) ) )
& ! [I] :
( ( property1(I,unhealthy,pos)
& cyclist(I) )
=> ? [J] :
( I = J
& property1(J,dishonest,pos) ) )
& ! [G] :
( cyclist(G)
=> ? [H] :
( G = H
& property1(H,industrious,pos) ) )
& ! [E] :
( ( property1(E,industrious,pos)
& grocer(E) )
=> ? [F] :
( E = F
& property1(F,honest,pos) ) )
& ! [C] :
( grocer(C)
=> ~ ? [D] :
( C = D
& property1(D,healthy,pos) ) )
& ! [A] :
( ( property1(A,industrious,pos)
& property1(A,honest,pos)
& person(A) )
=> ? [B] :
( A = B
& property1(B,healthy,pos) ) ) )
=> ! [S] :
( grocer(S)
=> ~ ? [T] :
( S = T
& cyclist(T) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f2,negated_conjecture,
~ ( ( ! [Q] :
( cyclist(Q)
=> ? [R] :
( Q = R
& person(R) ) )
& ! [O] :
( grocer(O)
=> ? [P] :
( O = P
& person(P) ) )
& ! [M] :
( ( property1(M,honest,pos)
& person(M) )
=> ~ ? [N] :
( M = N
& property1(N,dishonest,pos) ) )
& ! [K] :
( ( property1(K,healthy,pos)
& person(K) )
=> ~ ? [L] :
( K = L
& property1(L,unhealthy,pos) ) )
& ! [I] :
( ( property1(I,unhealthy,pos)
& cyclist(I) )
=> ? [J] :
( I = J
& property1(J,dishonest,pos) ) )
& ! [G] :
( cyclist(G)
=> ? [H] :
( G = H
& property1(H,industrious,pos) ) )
& ! [E] :
( ( property1(E,industrious,pos)
& grocer(E) )
=> ? [F] :
( E = F
& property1(F,honest,pos) ) )
& ! [C] :
( grocer(C)
=> ~ ? [D] :
( C = D
& property1(D,healthy,pos) ) )
& ! [A] :
( ( property1(A,industrious,pos)
& property1(A,honest,pos)
& person(A) )
=> ? [B] :
( A = B
& property1(B,healthy,pos) ) ) )
=> ! [S] :
( grocer(S)
=> ~ ? [T] :
( S = T
& cyclist(T) ) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
fof(f3,plain,
( ? [S] :
( ? [T] :
( S = T
& cyclist(T) )
& grocer(S) )
& ! [Q] :
( ? [R] :
( Q = R
& person(R) )
| ~ cyclist(Q) )
& ! [O] :
( ? [P] :
( O = P
& person(P) )
| ~ grocer(O) )
& ! [M] :
( ! [N] :
( M != N
| ~ property1(N,dishonest,pos) )
| ~ property1(M,honest,pos)
| ~ person(M) )
& ! [K] :
( ! [L] :
( K != L
| ~ property1(L,unhealthy,pos) )
| ~ property1(K,healthy,pos)
| ~ person(K) )
& ! [I] :
( ? [J] :
( I = J
& property1(J,dishonest,pos) )
| ~ property1(I,unhealthy,pos)
| ~ cyclist(I) )
& ! [G] :
( ? [H] :
( G = H
& property1(H,industrious,pos) )
| ~ cyclist(G) )
& ! [E] :
( ? [F] :
( E = F
& property1(F,honest,pos) )
| ~ property1(E,industrious,pos)
| ~ grocer(E) )
& ! [C] :
( ! [D] :
( C != D
| ~ property1(D,healthy,pos) )
| ~ grocer(C) )
& ! [A] :
( ? [B] :
( A = B
& property1(B,healthy,pos) )
| ~ property1(A,industrious,pos)
| ~ property1(A,honest,pos)
| ~ person(A) ) ),
inference(pre_NNF_transformation,[status(thm)],[f2]) ).
fof(f4,plain,
( sK6_skl = sK7_skl
& cyclist(sK7_skl)
& grocer(sK6_skl)
& ! [Q] :
( ( Q = sK5_skl(Q)
& person(sK5_skl(Q)) )
| ~ cyclist(Q) )
& ! [O] :
( ( O = sK4_skl(O)
& person(sK4_skl(O)) )
| ~ grocer(O) )
& ! [M] :
( ! [N] :
( M != N
| ~ property1(N,dishonest,pos) )
| ~ property1(M,honest,pos)
| ~ person(M) )
& ! [K] :
( ! [L] :
( K != L
| ~ property1(L,unhealthy,pos) )
| ~ property1(K,healthy,pos)
| ~ person(K) )
& ! [I] :
( ( I = sK3_skl(I)
& property1(sK3_skl(I),dishonest,pos) )
| ~ property1(I,unhealthy,pos)
| ~ cyclist(I) )
& ! [G] :
( ( G = sK2_skl(G)
& property1(sK2_skl(G),industrious,pos) )
| ~ cyclist(G) )
& ! [E] :
( ( E = sK1_skl(E)
& property1(sK1_skl(E),honest,pos) )
| ~ property1(E,industrious,pos)
| ~ grocer(E) )
& ! [C] :
( ! [D] :
( C != D
| ~ property1(D,healthy,pos) )
| ~ grocer(C) )
& ! [A] :
( ( A = sK0_skl(A)
& property1(sK0_skl(A),healthy,pos) )
| ~ property1(A,industrious,pos)
| ~ property1(A,honest,pos)
| ~ person(A) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0_skl,sK1_skl,sK2_skl,sK3_skl,sK4_skl,sK5_skl,sK6_skl,sK7_skl]),skolemize(B,sK0_skl(A)),skolemize(F,sK1_skl(E)),skolemize(H,sK2_skl(G)),skolemize(J,sK3_skl(I)),skolemize(P,sK4_skl(O)),skolemize(R,sK5_skl(Q)),skolemize(S,sK6_skl),skolemize(T,sK7_skl)],[f3]) ).
fof(f5,plain,
! [X0] :
( property1(sK0_skl(X0),healthy,pos)
| ~ property1(X0,industrious,pos)
| ~ property1(X0,honest,pos)
| ~ person(X0) ),
inference(cnf_transformation,[status(thm)],[f4]) ).
fof(f6,plain,
! [X0] :
( X0 = sK0_skl(X0)
| ~ property1(X0,industrious,pos)
| ~ property1(X0,honest,pos)
| ~ person(X0) ),
inference(cnf_transformation,[status(thm)],[f4]) ).
fof(f7,plain,
! [X0,X1] :
( X0 != X1
| ~ property1(X1,healthy,pos)
| ~ grocer(X0) ),
inference(cnf_transformation,[status(thm)],[f4]) ).
fof(f8,plain,
! [X0] :
( property1(sK1_skl(X0),honest,pos)
| ~ property1(X0,industrious,pos)
| ~ grocer(X0) ),
inference(cnf_transformation,[status(thm)],[f4]) ).
fof(f9,plain,
! [X0] :
( X0 = sK1_skl(X0)
| ~ property1(X0,industrious,pos)
| ~ grocer(X0) ),
inference(cnf_transformation,[status(thm)],[f4]) ).
fof(f10,plain,
! [X0] :
( property1(sK2_skl(X0),industrious,pos)
| ~ cyclist(X0) ),
inference(cnf_transformation,[status(thm)],[f4]) ).
fof(f11,plain,
! [X0] :
( X0 = sK2_skl(X0)
| ~ cyclist(X0) ),
inference(cnf_transformation,[status(thm)],[f4]) ).
fof(f16,plain,
! [X0] :
( person(sK4_skl(X0))
| ~ grocer(X0) ),
inference(cnf_transformation,[status(thm)],[f4]) ).
fof(f17,plain,
! [X0] :
( X0 = sK4_skl(X0)
| ~ grocer(X0) ),
inference(cnf_transformation,[status(thm)],[f4]) ).
fof(f20,plain,
grocer(sK6_skl),
inference(cnf_transformation,[status(thm)],[f4]) ).
fof(f21,plain,
cyclist(sK7_skl),
inference(cnf_transformation,[status(thm)],[f4]) ).
fof(f22,plain,
sK6_skl = sK7_skl,
inference(cnf_transformation,[status(thm)],[f4]) ).
fof(f23,plain,
! [X0] :
( ~ property1(X0,healthy,pos)
| ~ grocer(X0) ),
inference(destructive_equality_resolution,[status(thm)],[f7]) ).
fof(f26,plain,
cyclist(sK6_skl),
inference(backward_demodulation,[status(thm)],[f22,f21]) ).
fof(f27,plain,
sK6_skl = sK2_skl(sK6_skl),
inference(resolution,[status(thm)],[f11,f26]) ).
fof(f28,plain,
sK6_skl = sK4_skl(sK6_skl),
inference(resolution,[status(thm)],[f17,f20]) ).
fof(f30,plain,
( person(sK6_skl)
| ~ grocer(sK6_skl) ),
inference(paramodulation,[status(thm)],[f28,f16]) ).
fof(f31,plain,
person(sK6_skl),
inference(forward_subsumption_resolution,[status(thm)],[f30,f20]) ).
fof(f33,plain,
~ property1(sK6_skl,healthy,pos),
inference(resolution,[status(thm)],[f23,f20]) ).
fof(f34,plain,
( property1(sK6_skl,industrious,pos)
| ~ cyclist(sK6_skl) ),
inference(paramodulation,[status(thm)],[f27,f10]) ).
fof(f35,plain,
property1(sK6_skl,industrious,pos),
inference(forward_subsumption_resolution,[status(thm)],[f34,f26]) ).
fof(f36,plain,
( sK6_skl = sK1_skl(sK6_skl)
| ~ property1(sK6_skl,industrious,pos) ),
inference(resolution,[status(thm)],[f9,f20]) ).
fof(f37,plain,
sK6_skl = sK1_skl(sK6_skl),
inference(forward_subsumption_resolution,[status(thm)],[f36,f35]) ).
fof(f38,plain,
( property1(sK1_skl(sK6_skl),honest,pos)
| ~ property1(sK6_skl,industrious,pos) ),
inference(resolution,[status(thm)],[f8,f20]) ).
fof(f39,plain,
( property1(sK6_skl,honest,pos)
| ~ property1(sK6_skl,industrious,pos) ),
inference(forward_demodulation,[status(thm)],[f37,f38]) ).
fof(f40,plain,
property1(sK6_skl,honest,pos),
inference(forward_subsumption_resolution,[status(thm)],[f39,f35]) ).
fof(f41,plain,
( sK6_skl = sK0_skl(sK6_skl)
| ~ property1(sK6_skl,industrious,pos)
| ~ person(sK6_skl) ),
inference(resolution,[status(thm)],[f40,f6]) ).
fof(f42,plain,
( sK6_skl = sK0_skl(sK6_skl)
| ~ property1(sK6_skl,industrious,pos) ),
inference(forward_subsumption_resolution,[status(thm)],[f41,f31]) ).
fof(f43,plain,
sK6_skl = sK0_skl(sK6_skl),
inference(resolution,[status(thm)],[f42,f35]) ).
fof(f45,plain,
( property1(sK6_skl,healthy,pos)
| ~ property1(sK6_skl,industrious,pos)
| ~ property1(sK6_skl,honest,pos)
| ~ person(sK6_skl) ),
inference(paramodulation,[status(thm)],[f43,f5]) ).
fof(f46,plain,
( property1(sK6_skl,healthy,pos)
| ~ property1(sK6_skl,industrious,pos)
| ~ property1(sK6_skl,honest,pos) ),
inference(forward_subsumption_resolution,[status(thm)],[f45,f31]) ).
fof(f47,plain,
( ~ property1(sK6_skl,industrious,pos)
| ~ property1(sK6_skl,honest,pos) ),
inference(resolution,[status(thm)],[f46,f33]) ).
fof(f49,plain,
~ property1(sK6_skl,industrious,pos),
inference(forward_subsumption_resolution,[status(thm)],[f47,f40]) ).
fof(f50,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[f35,f49]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : PUZ129+2 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.08/0.35 % Computer : n016.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.08/0.35 % CPULimit : 300
% 0.08/0.35 % WCLimit : 300
% 0.08/0.35 % DateTime : Mon Sep 21 03:57:23 UTC 2026
% 0.08/0.35 % CPUTime :
% 0.08/0.36 % Drodi V4.1.1
% 0.08/0.38 % Refutation found
% 0.08/0.38 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.08/0.38 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.15/0.40 % Elapsed time: 0.048377 seconds
% 0.15/0.40 % CPU time: 0.139469 seconds
% 0.15/0.40 % Total memory used: 65.082 MB
% 0.15/0.40 % Net memory used: 64.549 MB
%------------------------------------------------------------------------------