TSTP Solution File: PUZ129+2 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : PUZ129+2 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n019.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Wed May 31 12:32:04 EDT 2023
% Result : Theorem 0.13s 0.35s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 8
% Syntax : Number of formulae : 57 ( 13 unt; 0 def)
% Number of atoms : 255 ( 54 equ)
% Maximal formula atoms : 36 ( 4 avg)
% Number of connectives : 301 ( 103 ~; 87 |; 82 &)
% ( 7 <=>; 22 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 13 ( 11 usr; 8 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,
( ( ! [A] :
( ( person(A)
& property1(A,honest,pos)
& property1(A,industrious,pos) )
=> ? [B] :
( property1(B,healthy,pos)
& A = B ) )
& ! [C] :
( grocer(C)
=> ~ ? [D] :
( property1(D,healthy,pos)
& C = D ) )
& ! [E] :
( ( grocer(E)
& property1(E,industrious,pos) )
=> ? [F] :
( property1(F,honest,pos)
& E = F ) )
& ! [G] :
( cyclist(G)
=> ? [H] :
( property1(H,industrious,pos)
& G = H ) )
& ! [I] :
( ( cyclist(I)
& property1(I,unhealthy,pos) )
=> ? [J] :
( property1(J,dishonest,pos)
& I = J ) )
& ! [K] :
( ( person(K)
& property1(K,healthy,pos) )
=> ~ ? [L] :
( property1(L,unhealthy,pos)
& K = L ) )
& ! [M] :
( ( person(M)
& property1(M,honest,pos) )
=> ~ ? [N] :
( property1(N,dishonest,pos)
& M = N ) )
& ! [O] :
( grocer(O)
=> ? [P] :
( person(P)
& O = P ) )
& ! [Q] :
( cyclist(Q)
=> ? [R] :
( person(R)
& Q = R ) ) )
=> ! [S] :
( grocer(S)
=> ~ ? [T] :
( cyclist(T)
& S = T ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f2,negated_conjecture,
~ ( ( ! [A] :
( ( person(A)
& property1(A,honest,pos)
& property1(A,industrious,pos) )
=> ? [B] :
( property1(B,healthy,pos)
& A = B ) )
& ! [C] :
( grocer(C)
=> ~ ? [D] :
( property1(D,healthy,pos)
& C = D ) )
& ! [E] :
( ( grocer(E)
& property1(E,industrious,pos) )
=> ? [F] :
( property1(F,honest,pos)
& E = F ) )
& ! [G] :
( cyclist(G)
=> ? [H] :
( property1(H,industrious,pos)
& G = H ) )
& ! [I] :
( ( cyclist(I)
& property1(I,unhealthy,pos) )
=> ? [J] :
( property1(J,dishonest,pos)
& I = J ) )
& ! [K] :
( ( person(K)
& property1(K,healthy,pos) )
=> ~ ? [L] :
( property1(L,unhealthy,pos)
& K = L ) )
& ! [M] :
( ( person(M)
& property1(M,honest,pos) )
=> ~ ? [N] :
( property1(N,dishonest,pos)
& M = N ) )
& ! [O] :
( grocer(O)
=> ? [P] :
( person(P)
& O = P ) )
& ! [Q] :
( cyclist(Q)
=> ? [R] :
( person(R)
& Q = R ) ) )
=> ! [S] :
( grocer(S)
=> ~ ? [T] :
( cyclist(T)
& S = T ) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
fof(f3,plain,
( ! [A] :
( ~ person(A)
| ~ property1(A,honest,pos)
| ~ property1(A,industrious,pos)
| ? [B] :
( property1(B,healthy,pos)
& A = B ) )
& ! [C] :
( ~ grocer(C)
| ! [D] :
( ~ property1(D,healthy,pos)
| C != D ) )
& ! [E] :
( ~ grocer(E)
| ~ property1(E,industrious,pos)
| ? [F] :
( property1(F,honest,pos)
& E = F ) )
& ! [G] :
( ~ cyclist(G)
| ? [H] :
( property1(H,industrious,pos)
& G = H ) )
& ! [I] :
( ~ cyclist(I)
| ~ property1(I,unhealthy,pos)
| ? [J] :
( property1(J,dishonest,pos)
& I = J ) )
& ! [K] :
( ~ person(K)
| ~ property1(K,healthy,pos)
| ! [L] :
( ~ property1(L,unhealthy,pos)
| K != L ) )
& ! [M] :
( ~ person(M)
| ~ property1(M,honest,pos)
| ! [N] :
( ~ property1(N,dishonest,pos)
| M != N ) )
& ! [O] :
( ~ grocer(O)
| ? [P] :
( person(P)
& O = P ) )
& ! [Q] :
( ~ cyclist(Q)
| ? [R] :
( person(R)
& Q = R ) )
& ? [S] :
( grocer(S)
& ? [T] :
( cyclist(T)
& S = T ) ) ),
inference(pre_NNF_transformation,[status(esa)],[f2]) ).
fof(f4,plain,
( ! [A] :
( ~ person(A)
| ~ property1(A,honest,pos)
| ~ property1(A,industrious,pos)
| ( property1(sk0_0(A),healthy,pos)
& A = sk0_0(A) ) )
& ! [C] :
( ~ grocer(C)
| ! [D] :
( ~ property1(D,healthy,pos)
| C != D ) )
& ! [E] :
( ~ grocer(E)
| ~ property1(E,industrious,pos)
| ( property1(sk0_1(E),honest,pos)
& E = sk0_1(E) ) )
& ! [G] :
( ~ cyclist(G)
| ( property1(sk0_2(G),industrious,pos)
& G = sk0_2(G) ) )
& ! [I] :
( ~ cyclist(I)
| ~ property1(I,unhealthy,pos)
| ( property1(sk0_3(I),dishonest,pos)
& I = sk0_3(I) ) )
& ! [K] :
( ~ person(K)
| ~ property1(K,healthy,pos)
| ! [L] :
( ~ property1(L,unhealthy,pos)
| K != L ) )
& ! [M] :
( ~ person(M)
| ~ property1(M,honest,pos)
| ! [N] :
( ~ property1(N,dishonest,pos)
| M != N ) )
& ! [O] :
( ~ grocer(O)
| ( person(sk0_4(O))
& O = sk0_4(O) ) )
& ! [Q] :
( ~ cyclist(Q)
| ( person(sk0_5(Q))
& Q = sk0_5(Q) ) )
& grocer(sk0_6)
& cyclist(sk0_7)
& sk0_6 = sk0_7 ),
inference(skolemization,[status(esa)],[f3]) ).
fof(f5,plain,
! [X0] :
( ~ person(X0)
| ~ property1(X0,honest,pos)
| ~ property1(X0,industrious,pos)
| property1(sk0_0(X0),healthy,pos) ),
inference(cnf_transformation,[status(esa)],[f4]) ).
fof(f6,plain,
! [X0] :
( ~ person(X0)
| ~ property1(X0,honest,pos)
| ~ property1(X0,industrious,pos)
| X0 = sk0_0(X0) ),
inference(cnf_transformation,[status(esa)],[f4]) ).
fof(f7,plain,
! [X0,X1] :
( ~ grocer(X0)
| ~ property1(X1,healthy,pos)
| X0 != X1 ),
inference(cnf_transformation,[status(esa)],[f4]) ).
fof(f8,plain,
! [X0] :
( ~ grocer(X0)
| ~ property1(X0,industrious,pos)
| property1(sk0_1(X0),honest,pos) ),
inference(cnf_transformation,[status(esa)],[f4]) ).
fof(f9,plain,
! [X0] :
( ~ grocer(X0)
| ~ property1(X0,industrious,pos)
| X0 = sk0_1(X0) ),
inference(cnf_transformation,[status(esa)],[f4]) ).
fof(f10,plain,
! [X0] :
( ~ cyclist(X0)
| property1(sk0_2(X0),industrious,pos) ),
inference(cnf_transformation,[status(esa)],[f4]) ).
fof(f11,plain,
! [X0] :
( ~ cyclist(X0)
| X0 = sk0_2(X0) ),
inference(cnf_transformation,[status(esa)],[f4]) ).
fof(f16,plain,
! [X0] :
( ~ grocer(X0)
| person(sk0_4(X0)) ),
inference(cnf_transformation,[status(esa)],[f4]) ).
fof(f17,plain,
! [X0] :
( ~ grocer(X0)
| X0 = sk0_4(X0) ),
inference(cnf_transformation,[status(esa)],[f4]) ).
fof(f20,plain,
grocer(sk0_6),
inference(cnf_transformation,[status(esa)],[f4]) ).
fof(f21,plain,
cyclist(sk0_7),
inference(cnf_transformation,[status(esa)],[f4]) ).
fof(f22,plain,
sk0_6 = sk0_7,
inference(cnf_transformation,[status(esa)],[f4]) ).
fof(f23,plain,
! [X0] :
( ~ grocer(X0)
| ~ property1(X0,healthy,pos) ),
inference(destructive_equality_resolution,[status(esa)],[f7]) ).
fof(f26,plain,
cyclist(sk0_6),
inference(backward_demodulation,[status(thm)],[f22,f21]) ).
fof(f27,plain,
sk0_6 = sk0_2(sk0_6),
inference(resolution,[status(thm)],[f11,f26]) ).
fof(f28,plain,
sk0_6 = sk0_4(sk0_6),
inference(resolution,[status(thm)],[f17,f20]) ).
fof(f30,plain,
person(sk0_4(sk0_6)),
inference(resolution,[status(thm)],[f16,f20]) ).
fof(f31,plain,
person(sk0_6),
inference(forward_demodulation,[status(thm)],[f28,f30]) ).
fof(f34,plain,
property1(sk0_2(sk0_6),industrious,pos),
inference(resolution,[status(thm)],[f10,f26]) ).
fof(f35,plain,
property1(sk0_6,industrious,pos),
inference(forward_demodulation,[status(thm)],[f27,f34]) ).
fof(f36,plain,
( spl0_0
<=> grocer(sk0_6) ),
introduced(split_symbol_definition) ).
fof(f38,plain,
( ~ grocer(sk0_6)
| spl0_0 ),
inference(component_clause,[status(thm)],[f36]) ).
fof(f39,plain,
( spl0_1
<=> property1(sk0_1(sk0_6),honest,pos) ),
introduced(split_symbol_definition) ).
fof(f40,plain,
( property1(sk0_1(sk0_6),honest,pos)
| ~ spl0_1 ),
inference(component_clause,[status(thm)],[f39]) ).
fof(f42,plain,
( ~ grocer(sk0_6)
| property1(sk0_1(sk0_6),honest,pos) ),
inference(resolution,[status(thm)],[f35,f8]) ).
fof(f43,plain,
( ~ spl0_0
| spl0_1 ),
inference(split_clause,[status(thm)],[f42,f36,f39]) ).
fof(f44,plain,
( spl0_2
<=> person(sk0_6) ),
introduced(split_symbol_definition) ).
fof(f46,plain,
( ~ person(sk0_6)
| spl0_2 ),
inference(component_clause,[status(thm)],[f44]) ).
fof(f47,plain,
( spl0_3
<=> property1(sk0_6,honest,pos) ),
introduced(split_symbol_definition) ).
fof(f49,plain,
( ~ property1(sk0_6,honest,pos)
| spl0_3 ),
inference(component_clause,[status(thm)],[f47]) ).
fof(f50,plain,
( spl0_4
<=> sk0_6 = sk0_0(sk0_6) ),
introduced(split_symbol_definition) ).
fof(f51,plain,
( sk0_6 = sk0_0(sk0_6)
| ~ spl0_4 ),
inference(component_clause,[status(thm)],[f50]) ).
fof(f53,plain,
( ~ person(sk0_6)
| ~ property1(sk0_6,honest,pos)
| sk0_6 = sk0_0(sk0_6) ),
inference(resolution,[status(thm)],[f35,f6]) ).
fof(f54,plain,
( ~ spl0_2
| ~ spl0_3
| spl0_4 ),
inference(split_clause,[status(thm)],[f53,f44,f47,f50]) ).
fof(f55,plain,
( spl0_5
<=> property1(sk0_0(sk0_6),healthy,pos) ),
introduced(split_symbol_definition) ).
fof(f56,plain,
( property1(sk0_0(sk0_6),healthy,pos)
| ~ spl0_5 ),
inference(component_clause,[status(thm)],[f55]) ).
fof(f58,plain,
( ~ person(sk0_6)
| ~ property1(sk0_6,honest,pos)
| property1(sk0_0(sk0_6),healthy,pos) ),
inference(resolution,[status(thm)],[f35,f5]) ).
fof(f59,plain,
( ~ spl0_2
| ~ spl0_3
| spl0_5 ),
inference(split_clause,[status(thm)],[f58,f44,f47,f55]) ).
fof(f60,plain,
( $false
| spl0_0 ),
inference(forward_subsumption_resolution,[status(thm)],[f38,f20]) ).
fof(f61,plain,
spl0_0,
inference(contradiction_clause,[status(thm)],[f60]) ).
fof(f62,plain,
( spl0_6
<=> sk0_6 = sk0_1(sk0_6) ),
introduced(split_symbol_definition) ).
fof(f63,plain,
( sk0_6 = sk0_1(sk0_6)
| ~ spl0_6 ),
inference(component_clause,[status(thm)],[f62]) ).
fof(f65,plain,
( ~ grocer(sk0_6)
| sk0_6 = sk0_1(sk0_6) ),
inference(resolution,[status(thm)],[f9,f35]) ).
fof(f66,plain,
( ~ spl0_0
| spl0_6 ),
inference(split_clause,[status(thm)],[f65,f36,f62]) ).
fof(f67,plain,
( property1(sk0_6,honest,pos)
| ~ spl0_6
| ~ spl0_1 ),
inference(backward_demodulation,[status(thm)],[f63,f40]) ).
fof(f68,plain,
( $false
| spl0_3
| ~ spl0_6
| ~ spl0_1 ),
inference(forward_subsumption_resolution,[status(thm)],[f67,f49]) ).
fof(f69,plain,
( spl0_3
| ~ spl0_6
| ~ spl0_1 ),
inference(contradiction_clause,[status(thm)],[f68]) ).
fof(f70,plain,
( $false
| spl0_2 ),
inference(forward_subsumption_resolution,[status(thm)],[f46,f31]) ).
fof(f71,plain,
spl0_2,
inference(contradiction_clause,[status(thm)],[f70]) ).
fof(f72,plain,
( property1(sk0_6,healthy,pos)
| ~ spl0_4
| ~ spl0_5 ),
inference(forward_demodulation,[status(thm)],[f51,f56]) ).
fof(f73,plain,
( ~ grocer(sk0_6)
| ~ spl0_4
| ~ spl0_5 ),
inference(resolution,[status(thm)],[f72,f23]) ).
fof(f74,plain,
( ~ spl0_0
| ~ spl0_4
| ~ spl0_5 ),
inference(split_clause,[status(thm)],[f73,f36,f50,f55]) ).
fof(f75,plain,
$false,
inference(sat_refutation,[status(thm)],[f43,f54,f59,f61,f66,f69,f71,f74]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : PUZ129+2 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.13 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.13/0.34 % Computer : n019.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Tue May 30 10:31:40 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.13/0.34 % Drodi V3.5.1
% 0.13/0.35 % Refutation found
% 0.13/0.35 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.13/0.35 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.13/0.36 % Elapsed time: 0.022332 seconds
% 0.13/0.36 % CPU time: 0.029224 seconds
% 0.13/0.36 % Memory used: 9.101 MB
%------------------------------------------------------------------------------