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 v1.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 : Unsatisfiable 0.06s 0.26s
% Output : CNFRefutation 0.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 16
% Syntax : Number of formulae : 51 ( 11 unt; 0 def)
% Number of atoms : 100 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 95 ( 46 ~; 43 |; 0 &)
% ( 6 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 11 ( 10 usr; 7 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 17 (; 17 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f2,hypothesis,
lives(butler),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f4,hypothesis,
! [X,Y] :
( ~ killed(X,Y)
| ~ richer(X,Y) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f5,hypothesis,
! [X] :
( ~ hates(agatha,X)
| ~ hates(charles,X) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f6,hypothesis,
! [X] :
( ~ hates(X,agatha)
| ~ hates(X,butler)
| ~ hates(X,charles) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f7,hypothesis,
hates(agatha,agatha),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f8,hypothesis,
hates(agatha,charles),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f9,hypothesis,
! [X,Y] :
( ~ killed(X,Y)
| hates(X,Y) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f10,hypothesis,
! [X] :
( ~ hates(agatha,X)
| hates(butler,X) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f11,hypothesis,
! [X] :
( ~ lives(X)
| richer(X,agatha)
| hates(butler,X) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f12,negated_conjecture,
( killed(butler,agatha)
| killed(charles,agatha) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f14,plain,
lives(butler),
inference(cnf_transformation,[status(esa)],[f2]) ).
fof(f16,plain,
! [X0,X1] :
( ~ killed(X0,X1)
| ~ richer(X0,X1) ),
inference(cnf_transformation,[status(esa)],[f4]) ).
fof(f17,plain,
! [X0] :
( ~ hates(agatha,X0)
| ~ hates(charles,X0) ),
inference(cnf_transformation,[status(esa)],[f5]) ).
fof(f18,plain,
! [X0] :
( ~ hates(X0,agatha)
| ~ hates(X0,butler)
| ~ hates(X0,charles) ),
inference(cnf_transformation,[status(esa)],[f6]) ).
fof(f19,plain,
hates(agatha,agatha),
inference(cnf_transformation,[status(esa)],[f7]) ).
fof(f20,plain,
hates(agatha,charles),
inference(cnf_transformation,[status(esa)],[f8]) ).
fof(f21,plain,
! [X0,X1] :
( ~ killed(X0,X1)
| hates(X0,X1) ),
inference(cnf_transformation,[status(esa)],[f9]) ).
fof(f22,plain,
! [X0] :
( ~ hates(agatha,X0)
| hates(butler,X0) ),
inference(cnf_transformation,[status(esa)],[f10]) ).
fof(f23,plain,
! [X0] :
( ~ lives(X0)
| richer(X0,agatha)
| hates(butler,X0) ),
inference(cnf_transformation,[status(esa)],[f11]) ).
fof(f24,plain,
( killed(butler,agatha)
| killed(charles,agatha) ),
inference(cnf_transformation,[status(esa)],[f12]) ).
fof(f25,plain,
( spl0_0
<=> killed(butler,agatha) ),
introduced(split_symbol_definition) ).
fof(f26,plain,
( killed(butler,agatha)
| ~ spl0_0 ),
inference(component_clause,[status(thm)],[f25]) ).
fof(f28,plain,
( spl0_1
<=> killed(charles,agatha) ),
introduced(split_symbol_definition) ).
fof(f29,plain,
( killed(charles,agatha)
| ~ spl0_1 ),
inference(component_clause,[status(thm)],[f28]) ).
fof(f31,plain,
( spl0_0
| spl0_1 ),
inference(split_clause,[status(thm)],[f24,f25,f28]) ).
fof(f32,plain,
! [X0] :
( ~ hates(agatha,X0)
| ~ killed(charles,X0) ),
inference(resolution,[status(thm)],[f17,f21]) ).
fof(f33,plain,
( spl0_2
<=> hates(butler,agatha) ),
introduced(split_symbol_definition) ).
fof(f35,plain,
( ~ hates(butler,agatha)
| spl0_2 ),
inference(component_clause,[status(thm)],[f33]) ).
fof(f36,plain,
( spl0_3
<=> hates(butler,charles) ),
introduced(split_symbol_definition) ).
fof(f38,plain,
( ~ hates(butler,charles)
| spl0_3 ),
inference(component_clause,[status(thm)],[f36]) ).
fof(f45,plain,
( spl0_5
<=> lives(butler) ),
introduced(split_symbol_definition) ).
fof(f47,plain,
( ~ lives(butler)
| spl0_5 ),
inference(component_clause,[status(thm)],[f45]) ).
fof(f48,plain,
( spl0_6
<=> richer(butler,agatha) ),
introduced(split_symbol_definition) ).
fof(f49,plain,
( richer(butler,agatha)
| ~ spl0_6 ),
inference(component_clause,[status(thm)],[f48]) ).
fof(f51,plain,
( ~ lives(butler)
| richer(butler,agatha)
| ~ hates(butler,agatha)
| ~ hates(butler,charles) ),
inference(resolution,[status(thm)],[f23,f18]) ).
fof(f52,plain,
( ~ spl0_5
| spl0_6
| ~ spl0_2
| ~ spl0_3 ),
inference(split_clause,[status(thm)],[f51,f45,f48,f33,f36]) ).
fof(f53,plain,
( $false
| spl0_5 ),
inference(forward_subsumption_resolution,[status(thm)],[f47,f14]) ).
fof(f54,plain,
spl0_5,
inference(contradiction_clause,[status(thm)],[f53]) ).
fof(f64,plain,
( ~ hates(agatha,charles)
| spl0_3 ),
inference(resolution,[status(thm)],[f38,f22]) ).
fof(f65,plain,
( $false
| spl0_3 ),
inference(forward_subsumption_resolution,[status(thm)],[f64,f20]) ).
fof(f66,plain,
spl0_3,
inference(contradiction_clause,[status(thm)],[f65]) ).
fof(f75,plain,
( ~ hates(agatha,agatha)
| spl0_2 ),
inference(resolution,[status(thm)],[f35,f22]) ).
fof(f76,plain,
( $false
| spl0_2 ),
inference(forward_subsumption_resolution,[status(thm)],[f75,f19]) ).
fof(f77,plain,
spl0_2,
inference(contradiction_clause,[status(thm)],[f76]) ).
fof(f79,plain,
( ~ killed(butler,agatha)
| ~ spl0_6 ),
inference(resolution,[status(thm)],[f49,f16]) ).
fof(f80,plain,
( $false
| ~ spl0_0
| ~ spl0_6 ),
inference(forward_subsumption_resolution,[status(thm)],[f79,f26]) ).
fof(f81,plain,
( ~ spl0_0
| ~ spl0_6 ),
inference(contradiction_clause,[status(thm)],[f80]) ).
fof(f82,plain,
( ~ hates(agatha,agatha)
| ~ spl0_1 ),
inference(resolution,[status(thm)],[f29,f32]) ).
fof(f83,plain,
( $false
| ~ spl0_1 ),
inference(forward_subsumption_resolution,[status(thm)],[f82,f19]) ).
fof(f84,plain,
~ spl0_1,
inference(contradiction_clause,[status(thm)],[f83]) ).
fof(f85,plain,
$false,
inference(sat_refutation,[status(thm)],[f31,f52,f54,f66,f77,f81,f84]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.07 % Problem : PUZ001-1 : TPTP v8.1.2. Released v1.0.0.
% 0.04/0.07 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.06/0.25 % Computer : n005.cluster.edu
% 0.06/0.25 % Model : x86_64 x86_64
% 0.06/0.25 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.25 % Memory : 8042.1875MB
% 0.06/0.25 % OS : Linux 3.10.0-693.el7.x86_64
% 0.06/0.25 % CPULimit : 300
% 0.06/0.25 % WCLimit : 300
% 0.06/0.25 % DateTime : Tue May 30 10:28:36 EDT 2023
% 0.06/0.25 % CPUTime :
% 0.06/0.26 % Drodi V3.5.1
% 0.06/0.26 % Refutation found
% 0.06/0.26 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.06/0.26 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.10/0.48 % Elapsed time: 0.006991 seconds
% 0.10/0.48 % CPU time: 0.019265 seconds
% 0.10/0.48 % Memory used: 1.876 MB
%------------------------------------------------------------------------------