TSTP Solution File: PUZ001+1 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : PUZ001+1 : TPTP v8.1.2. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n005.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:31:43 EDT 2023
% Result : Theorem 0.07s 0.27s
% Output : CNFRefutation 0.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 15
% Syntax : Number of formulae : 62 ( 17 unt; 0 def)
% Number of atoms : 115 ( 28 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 98 ( 45 ~; 40 |; 2 &)
% ( 4 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 5 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-1 aty)
% Number of variables : 34 (; 32 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
? [X] :
( lives(X)
& killed(X,agatha) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f5,axiom,
! [X] :
( lives(X)
=> ( X = agatha
| X = butler
| X = charles ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f6,axiom,
! [X,Y] :
( killed(X,Y)
=> hates(X,Y) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f7,axiom,
! [X,Y] :
( killed(X,Y)
=> ~ richer(X,Y) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f8,axiom,
! [X] :
( hates(agatha,X)
=> ~ hates(charles,X) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f9,axiom,
! [X] :
( X != butler
=> hates(agatha,X) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f10,axiom,
! [X] :
( ~ richer(X,agatha)
=> hates(butler,X) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f11,axiom,
! [X] :
( hates(agatha,X)
=> hates(butler,X) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f12,axiom,
! [X] :
? [Y] : ~ hates(X,Y),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f13,axiom,
agatha != butler,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f14,conjecture,
killed(agatha,agatha),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f15,negated_conjecture,
~ killed(agatha,agatha),
inference(negated_conjecture,[status(cth)],[f14]) ).
fof(f16,plain,
( lives(sk0_0)
& killed(sk0_0,agatha) ),
inference(skolemization,[status(esa)],[f1]) ).
fof(f17,plain,
lives(sk0_0),
inference(cnf_transformation,[status(esa)],[f16]) ).
fof(f18,plain,
killed(sk0_0,agatha),
inference(cnf_transformation,[status(esa)],[f16]) ).
fof(f22,plain,
! [X] :
( ~ lives(X)
| X = agatha
| X = butler
| X = charles ),
inference(pre_NNF_transformation,[status(esa)],[f5]) ).
fof(f23,plain,
! [X0] :
( ~ lives(X0)
| X0 = agatha
| X0 = butler
| X0 = charles ),
inference(cnf_transformation,[status(esa)],[f22]) ).
fof(f24,plain,
! [X,Y] :
( ~ killed(X,Y)
| hates(X,Y) ),
inference(pre_NNF_transformation,[status(esa)],[f6]) ).
fof(f25,plain,
! [X0,X1] :
( ~ killed(X0,X1)
| hates(X0,X1) ),
inference(cnf_transformation,[status(esa)],[f24]) ).
fof(f26,plain,
! [X,Y] :
( ~ killed(X,Y)
| ~ richer(X,Y) ),
inference(pre_NNF_transformation,[status(esa)],[f7]) ).
fof(f27,plain,
! [X0,X1] :
( ~ killed(X0,X1)
| ~ richer(X0,X1) ),
inference(cnf_transformation,[status(esa)],[f26]) ).
fof(f28,plain,
! [X] :
( ~ hates(agatha,X)
| ~ hates(charles,X) ),
inference(pre_NNF_transformation,[status(esa)],[f8]) ).
fof(f29,plain,
! [X0] :
( ~ hates(agatha,X0)
| ~ hates(charles,X0) ),
inference(cnf_transformation,[status(esa)],[f28]) ).
fof(f30,plain,
! [X] :
( X = butler
| hates(agatha,X) ),
inference(pre_NNF_transformation,[status(esa)],[f9]) ).
fof(f31,plain,
! [X0] :
( X0 = butler
| hates(agatha,X0) ),
inference(cnf_transformation,[status(esa)],[f30]) ).
fof(f32,plain,
! [X] :
( richer(X,agatha)
| hates(butler,X) ),
inference(pre_NNF_transformation,[status(esa)],[f10]) ).
fof(f33,plain,
! [X0] :
( richer(X0,agatha)
| hates(butler,X0) ),
inference(cnf_transformation,[status(esa)],[f32]) ).
fof(f34,plain,
! [X] :
( ~ hates(agatha,X)
| hates(butler,X) ),
inference(pre_NNF_transformation,[status(esa)],[f11]) ).
fof(f35,plain,
! [X0] :
( ~ hates(agatha,X0)
| hates(butler,X0) ),
inference(cnf_transformation,[status(esa)],[f34]) ).
fof(f36,plain,
! [X] : ~ hates(X,sk0_1(X)),
inference(skolemization,[status(esa)],[f12]) ).
fof(f37,plain,
! [X0] : ~ hates(X0,sk0_1(X0)),
inference(cnf_transformation,[status(esa)],[f36]) ).
fof(f38,plain,
agatha != butler,
inference(cnf_transformation,[status(esa)],[f13]) ).
fof(f39,plain,
~ killed(agatha,agatha),
inference(cnf_transformation,[status(esa)],[f15]) ).
fof(f40,plain,
hates(sk0_0,agatha),
inference(resolution,[status(thm)],[f18,f25]) ).
fof(f43,plain,
! [X0] :
( hates(butler,X0)
| ~ killed(X0,agatha) ),
inference(resolution,[status(thm)],[f33,f27]) ).
fof(f55,plain,
( spl0_3
<=> butler = agatha ),
introduced(split_symbol_definition) ).
fof(f56,plain,
( butler = agatha
| ~ spl0_3 ),
inference(component_clause,[status(thm)],[f55]) ).
fof(f68,plain,
( spl0_6
<=> sk0_0 = agatha ),
introduced(split_symbol_definition) ).
fof(f69,plain,
( sk0_0 = agatha
| ~ spl0_6 ),
inference(component_clause,[status(thm)],[f68]) ).
fof(f71,plain,
( spl0_7
<=> sk0_0 = butler ),
introduced(split_symbol_definition) ).
fof(f72,plain,
( sk0_0 = butler
| ~ spl0_7 ),
inference(component_clause,[status(thm)],[f71]) ).
fof(f74,plain,
( spl0_8
<=> sk0_0 = charles ),
introduced(split_symbol_definition) ).
fof(f75,plain,
( sk0_0 = charles
| ~ spl0_8 ),
inference(component_clause,[status(thm)],[f74]) ).
fof(f77,plain,
( sk0_0 = agatha
| sk0_0 = butler
| sk0_0 = charles ),
inference(resolution,[status(thm)],[f23,f17]) ).
fof(f78,plain,
( spl0_6
| spl0_7
| spl0_8 ),
inference(split_clause,[status(thm)],[f77,f68,f71,f74]) ).
fof(f79,plain,
( $false
| ~ spl0_3 ),
inference(forward_subsumption_resolution,[status(thm)],[f56,f38]) ).
fof(f80,plain,
~ spl0_3,
inference(contradiction_clause,[status(thm)],[f79]) ).
fof(f81,plain,
! [X0] :
( hates(butler,X0)
| X0 = butler ),
inference(resolution,[status(thm)],[f35,f31]) ).
fof(f82,plain,
sk0_1(butler) = butler,
inference(resolution,[status(thm)],[f81,f37]) ).
fof(f83,plain,
~ hates(butler,butler),
inference(paramodulation,[status(thm)],[f82,f37]) ).
fof(f102,plain,
( hates(charles,agatha)
| ~ spl0_8 ),
inference(backward_demodulation,[status(thm)],[f75,f40]) ).
fof(f105,plain,
( ~ hates(agatha,agatha)
| ~ spl0_8 ),
inference(resolution,[status(thm)],[f102,f29]) ).
fof(f106,plain,
( agatha = butler
| ~ spl0_8 ),
inference(resolution,[status(thm)],[f105,f31]) ).
fof(f107,plain,
( spl0_3
| ~ spl0_8 ),
inference(split_clause,[status(thm)],[f106,f55,f74]) ).
fof(f119,plain,
( killed(agatha,agatha)
| ~ spl0_6 ),
inference(backward_demodulation,[status(thm)],[f69,f18]) ).
fof(f120,plain,
( $false
| ~ spl0_6 ),
inference(forward_subsumption_resolution,[status(thm)],[f119,f39]) ).
fof(f121,plain,
~ spl0_6,
inference(contradiction_clause,[status(thm)],[f120]) ).
fof(f138,plain,
( killed(butler,agatha)
| ~ spl0_7 ),
inference(forward_demodulation,[status(thm)],[f72,f18]) ).
fof(f139,plain,
( hates(butler,butler)
| ~ spl0_7 ),
inference(resolution,[status(thm)],[f138,f43]) ).
fof(f140,plain,
( $false
| ~ spl0_7 ),
inference(forward_subsumption_resolution,[status(thm)],[f139,f83]) ).
fof(f141,plain,
~ spl0_7,
inference(contradiction_clause,[status(thm)],[f140]) ).
fof(f142,plain,
$false,
inference(sat_refutation,[status(thm)],[f78,f80,f107,f121,f141]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.07 % Problem : PUZ001+1 : TPTP v8.1.2. Released v2.0.0.
% 0.07/0.08 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.07/0.26 % Computer : n005.cluster.edu
% 0.07/0.26 % Model : x86_64 x86_64
% 0.07/0.26 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.26 % Memory : 8042.1875MB
% 0.07/0.26 % OS : Linux 3.10.0-693.el7.x86_64
% 0.07/0.26 % CPULimit : 300
% 0.07/0.26 % WCLimit : 300
% 0.07/0.26 % DateTime : Tue May 30 10:28:36 EDT 2023
% 0.07/0.26 % CPUTime :
% 0.07/0.27 % Drodi V3.5.1
% 0.07/0.27 % Refutation found
% 0.07/0.27 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.07/0.27 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.07/0.28 % Elapsed time: 0.014475 seconds
% 0.07/0.28 % CPU time: 0.022799 seconds
% 0.07/0.28 % Memory used: 11.480 MB
%------------------------------------------------------------------------------