TSTP Solution File: PUZ132+1 by PyRes---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : PyRes---1.5
% Problem : PUZ132+1 : TPTP v8.1.2. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %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 : Thu May 9 17:37:50 EDT 2024
% Result : Theorem 0.21s 0.60s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of formulae : 30 ( 12 unt; 0 def)
% Number of atoms : 49 ( 3 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 37 ( 18 ~; 14 |; 2 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-1 aty)
% Number of variables : 14 ( 0 sgn 9 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(crime_axiom,axiom,
! [X] :
( city(X)
=> has_crime(X) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',crime_axiom) ).
fof(c13,plain,
! [X] :
( ~ city(X)
| has_crime(X) ),
inference(fof_nnf,[status(thm)],[crime_axiom]) ).
fof(c14,plain,
! [X3] :
( ~ city(X3)
| has_crime(X3) ),
inference(variable_rename,[status(thm)],[c13]) ).
cnf(c15,plain,
( ~ city(X13)
| has_crime(X13) ),
inference(split_conjunct,[status(thm)],[c14]) ).
fof(washington_type,axiom,
capital(washington),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',washington_type) ).
cnf(c20,plain,
capital(washington),
inference(split_conjunct,[status(thm)],[washington_type]) ).
fof(capital_city_type,axiom,
! [A] :
( capital(A)
=> city(A) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',capital_city_type) ).
fof(c24,plain,
! [A] :
( ~ capital(A)
| city(A) ),
inference(fof_nnf,[status(thm)],[capital_city_type]) ).
fof(c25,plain,
! [X6] :
( ~ capital(X6)
| city(X6) ),
inference(variable_rename,[status(thm)],[c24]) ).
cnf(c26,plain,
( ~ capital(X14)
| city(X14) ),
inference(split_conjunct,[status(thm)],[c25]) ).
cnf(c35,plain,
city(washington),
inference(resolution,[status(thm)],[c26,c20]) ).
cnf(c39,plain,
has_crime(washington),
inference(resolution,[status(thm)],[c35,c15]) ).
fof(washington_conjecture,conjecture,
( beautiful(washington)
& has_crime(washington) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',washington_conjecture) ).
fof(c6,negated_conjecture,
~ ( beautiful(washington)
& has_crime(washington) ),
inference(assume_negation,[status(cth)],[washington_conjecture]) ).
fof(c7,negated_conjecture,
( ~ beautiful(washington)
| ~ has_crime(washington) ),
inference(fof_nnf,[status(thm)],[c6]) ).
cnf(c8,negated_conjecture,
( ~ beautiful(washington)
| ~ has_crime(washington) ),
inference(split_conjunct,[status(thm)],[c7]) ).
cnf(c41,plain,
~ beautiful(washington),
inference(resolution,[status(thm)],[c8,c39]) ).
fof(usa_type,axiom,
country(usa),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',usa_type) ).
cnf(c19,plain,
country(usa),
inference(split_conjunct,[status(thm)],[usa_type]) ).
fof(beautiful_capital_axiom,axiom,
! [X] :
( country(X)
=> beautiful(capital_city(X)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',beautiful_capital_axiom) ).
fof(c9,plain,
! [X] :
( ~ country(X)
| beautiful(capital_city(X)) ),
inference(fof_nnf,[status(thm)],[beautiful_capital_axiom]) ).
fof(c10,plain,
! [X2] :
( ~ country(X2)
| beautiful(capital_city(X2)) ),
inference(variable_rename,[status(thm)],[c9]) ).
cnf(c11,plain,
( ~ country(X20)
| beautiful(capital_city(X20)) ),
inference(split_conjunct,[status(thm)],[c10]) ).
cnf(c43,plain,
beautiful(capital_city(usa)),
inference(resolution,[status(thm)],[c11,c19]) ).
fof(usa_capital_axiom,axiom,
capital_city(usa) = washington,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',usa_capital_axiom) ).
cnf(c12,plain,
capital_city(usa) = washington,
inference(split_conjunct,[status(thm)],[usa_capital_axiom]) ).
cnf(c5,axiom,
( X38 != X39
| ~ beautiful(X38)
| beautiful(X39) ),
theory(equality) ).
cnf(c71,plain,
( ~ beautiful(capital_city(usa))
| beautiful(washington) ),
inference(resolution,[status(thm)],[c5,c12]) ).
cnf(c82,plain,
beautiful(washington),
inference(resolution,[status(thm)],[c71,c43]) ).
cnf(c91,plain,
$false,
inference(resolution,[status(thm)],[c82,c41]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : PUZ132+1 : TPTP v8.1.2. Released v4.1.0.
% 0.08/0.14 % Command : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% 0.14/0.36 % Computer : n015.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Wed May 8 20:46:38 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.21/0.60 % Version: 1.5
% 0.21/0.60 % SZS status Theorem
% 0.21/0.60 % SZS output start CNFRefutation
% See solution above
% 0.21/0.60
% 0.21/0.60 % Initial clauses : 20
% 0.21/0.60 % Processed clauses : 42
% 0.21/0.60 % Factors computed : 1
% 0.21/0.60 % Resolvents computed: 58
% 0.21/0.60 % Tautologies deleted: 7
% 0.21/0.60 % Forward subsumed : 12
% 0.21/0.60 % Backward subsumed : 2
% 0.21/0.60 % -------- CPU Time ---------
% 0.21/0.60 % User time : 0.223 s
% 0.21/0.60 % System time : 0.016 s
% 0.21/0.60 % Total time : 0.239 s
%------------------------------------------------------------------------------