TSTP Solution File: PUZ132+1 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : PUZ132+1 : TPTP v8.1.2. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n015.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:05 EDT 2023
% Result : Theorem 0.10s 0.48s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 10
% Syntax : Number of formulae : 34 ( 9 unt; 0 def)
% Number of atoms : 59 ( 2 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 44 ( 19 ~; 17 |; 2 &)
% ( 3 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 4 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-1 aty)
% Number of variables : 9 (; 9 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [A] :
( capital(A)
=> city(A) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f5,axiom,
capital(washington),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f6,axiom,
country(usa),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f8,axiom,
! [X] :
( city(X)
=> has_crime(X) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f9,axiom,
capital_city(usa) = washington,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f10,axiom,
! [X] :
( country(X)
=> beautiful(capital_city(X)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f11,conjecture,
( beautiful(washington)
& has_crime(washington) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f12,negated_conjecture,
~ ( beautiful(washington)
& has_crime(washington) ),
inference(negated_conjecture,[status(cth)],[f11]) ).
fof(f17,plain,
! [A] :
( ~ capital(A)
| city(A) ),
inference(pre_NNF_transformation,[status(esa)],[f3]) ).
fof(f18,plain,
! [X0] :
( ~ capital(X0)
| city(X0) ),
inference(cnf_transformation,[status(esa)],[f17]) ).
fof(f21,plain,
capital(washington),
inference(cnf_transformation,[status(esa)],[f5]) ).
fof(f22,plain,
country(usa),
inference(cnf_transformation,[status(esa)],[f6]) ).
fof(f25,plain,
! [X] :
( ~ city(X)
| has_crime(X) ),
inference(pre_NNF_transformation,[status(esa)],[f8]) ).
fof(f26,plain,
! [X0] :
( ~ city(X0)
| has_crime(X0) ),
inference(cnf_transformation,[status(esa)],[f25]) ).
fof(f27,plain,
capital_city(usa) = washington,
inference(cnf_transformation,[status(esa)],[f9]) ).
fof(f28,plain,
! [X] :
( ~ country(X)
| beautiful(capital_city(X)) ),
inference(pre_NNF_transformation,[status(esa)],[f10]) ).
fof(f29,plain,
! [X0] :
( ~ country(X0)
| beautiful(capital_city(X0)) ),
inference(cnf_transformation,[status(esa)],[f28]) ).
fof(f30,plain,
( ~ beautiful(washington)
| ~ has_crime(washington) ),
inference(pre_NNF_transformation,[status(esa)],[f12]) ).
fof(f31,plain,
( ~ beautiful(washington)
| ~ has_crime(washington) ),
inference(cnf_transformation,[status(esa)],[f30]) ).
fof(f32,plain,
( spl0_0
<=> beautiful(washington) ),
introduced(split_symbol_definition) ).
fof(f35,plain,
( spl0_1
<=> has_crime(washington) ),
introduced(split_symbol_definition) ).
fof(f37,plain,
( ~ has_crime(washington)
| spl0_1 ),
inference(component_clause,[status(thm)],[f35]) ).
fof(f38,plain,
( ~ spl0_0
| ~ spl0_1 ),
inference(split_clause,[status(thm)],[f31,f32,f35]) ).
fof(f39,plain,
( spl0_2
<=> country(usa) ),
introduced(split_symbol_definition) ).
fof(f41,plain,
( ~ country(usa)
| spl0_2 ),
inference(component_clause,[status(thm)],[f39]) ).
fof(f42,plain,
( ~ country(usa)
| beautiful(washington) ),
inference(paramodulation,[status(thm)],[f27,f29]) ).
fof(f43,plain,
( ~ spl0_2
| spl0_0 ),
inference(split_clause,[status(thm)],[f42,f39,f32]) ).
fof(f44,plain,
( $false
| spl0_2 ),
inference(forward_subsumption_resolution,[status(thm)],[f41,f22]) ).
fof(f45,plain,
spl0_2,
inference(contradiction_clause,[status(thm)],[f44]) ).
fof(f51,plain,
( ~ city(washington)
| spl0_1 ),
inference(resolution,[status(thm)],[f37,f26]) ).
fof(f52,plain,
( ~ capital(washington)
| spl0_1 ),
inference(resolution,[status(thm)],[f51,f18]) ).
fof(f53,plain,
( $false
| spl0_1 ),
inference(forward_subsumption_resolution,[status(thm)],[f52,f21]) ).
fof(f54,plain,
spl0_1,
inference(contradiction_clause,[status(thm)],[f53]) ).
fof(f55,plain,
$false,
inference(sat_refutation,[status(thm)],[f38,f43,f45,f54]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.07 % Problem : PUZ132+1 : TPTP v8.1.2. Released v4.1.0.
% 0.06/0.07 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.06/0.26 % Computer : n015.cluster.edu
% 0.06/0.26 % Model : x86_64 x86_64
% 0.06/0.26 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.26 % Memory : 8042.1875MB
% 0.06/0.26 % OS : Linux 3.10.0-693.el7.x86_64
% 0.06/0.26 % CPULimit : 300
% 0.06/0.26 % WCLimit : 300
% 0.06/0.26 % DateTime : Tue May 30 10:46:34 EDT 2023
% 0.06/0.26 % CPUTime :
% 0.06/0.26 % Drodi V3.5.1
% 0.10/0.48 % Refutation found
% 0.10/0.48 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.10/0.48 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.10/0.48 % Elapsed time: 0.009070 seconds
% 0.10/0.48 % CPU time: 0.017153 seconds
% 0.10/0.48 % Memory used: 8.993 MB
%------------------------------------------------------------------------------