TSTP Solution File: PUZ132+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : PUZ132+1 : TPTP v8.1.2. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n032.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 : Fri May 3 02:54:57 EDT 2024
% Result : Theorem 0.60s 0.99s
% Output : CNFRefutation 0.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 7
% Syntax : Number of formulae : 35 ( 12 unt; 0 def)
% Number of atoms : 58 ( 7 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 47 ( 24 ~; 16 |; 2 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 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 : 16 ( 0 sgn 11 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X0] :
( capital(X0)
=> city(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',capital_city_type) ).
fof(f5,axiom,
capital(washington),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',washington_type) ).
fof(f6,axiom,
country(usa),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',usa_type) ).
fof(f8,axiom,
! [X1] :
( city(X1)
=> has_crime(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',crime_axiom) ).
fof(f9,axiom,
washington = capital_city(usa),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',usa_capital_axiom) ).
fof(f10,axiom,
! [X1] :
( country(X1)
=> beautiful(capital_city(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',beautiful_capital_axiom) ).
fof(f11,conjecture,
( has_crime(washington)
& beautiful(washington) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',washington_conjecture) ).
fof(f12,negated_conjecture,
~ ( has_crime(washington)
& beautiful(washington) ),
inference(negated_conjecture,[],[f11]) ).
fof(f13,plain,
! [X0] :
( city(X0)
=> has_crime(X0) ),
inference(rectify,[],[f8]) ).
fof(f14,plain,
! [X0] :
( country(X0)
=> beautiful(capital_city(X0)) ),
inference(rectify,[],[f10]) ).
fof(f15,plain,
! [X0] :
( city(X0)
| ~ capital(X0) ),
inference(ennf_transformation,[],[f3]) ).
fof(f17,plain,
! [X0] :
( has_crime(X0)
| ~ city(X0) ),
inference(ennf_transformation,[],[f13]) ).
fof(f18,plain,
! [X0] :
( beautiful(capital_city(X0))
| ~ country(X0) ),
inference(ennf_transformation,[],[f14]) ).
fof(f19,plain,
( ~ has_crime(washington)
| ~ beautiful(washington) ),
inference(ennf_transformation,[],[f12]) ).
fof(f28,plain,
! [X0] :
( city(X0)
| ~ capital(X0) ),
inference(cnf_transformation,[],[f15]) ).
fof(f30,plain,
capital(washington),
inference(cnf_transformation,[],[f5]) ).
fof(f31,plain,
country(usa),
inference(cnf_transformation,[],[f6]) ).
fof(f33,plain,
! [X0] :
( has_crime(X0)
| ~ city(X0) ),
inference(cnf_transformation,[],[f17]) ).
fof(f34,plain,
washington = capital_city(usa),
inference(cnf_transformation,[],[f9]) ).
fof(f35,plain,
! [X0] :
( beautiful(capital_city(X0))
| ~ country(X0) ),
inference(cnf_transformation,[],[f18]) ).
fof(f36,plain,
( ~ has_crime(washington)
| ~ beautiful(washington) ),
inference(cnf_transformation,[],[f19]) ).
cnf(c_51,plain,
( ~ capital(X0)
| city(X0) ),
inference(cnf_transformation,[],[f28]) ).
cnf(c_53,plain,
capital(washington),
inference(cnf_transformation,[],[f30]) ).
cnf(c_54,plain,
country(usa),
inference(cnf_transformation,[],[f31]) ).
cnf(c_56,plain,
( ~ city(X0)
| has_crime(X0) ),
inference(cnf_transformation,[],[f33]) ).
cnf(c_57,plain,
capital_city(usa) = washington,
inference(cnf_transformation,[],[f34]) ).
cnf(c_58,plain,
( ~ country(X0)
| beautiful(capital_city(X0)) ),
inference(cnf_transformation,[],[f35]) ).
cnf(c_59,negated_conjecture,
( ~ has_crime(washington)
| ~ beautiful(washington) ),
inference(cnf_transformation,[],[f36]) ).
cnf(c_60,plain,
( ~ city(washington)
| has_crime(washington) ),
inference(instantiation,[status(thm)],[c_56]) ).
cnf(c_61,plain,
( ~ capital(washington)
| city(washington) ),
inference(instantiation,[status(thm)],[c_51]) ).
cnf(c_64,negated_conjecture,
~ beautiful(washington),
inference(global_subsumption_just,[status(thm)],[c_59,c_53,c_60,c_61,c_59]) ).
cnf(c_118,plain,
( capital_city(X0) != washington
| ~ country(X0) ),
inference(resolution_lifted,[status(thm)],[c_58,c_64]) ).
cnf(c_133,plain,
( capital_city(X0) != washington
| X0 != usa ),
inference(resolution_lifted,[status(thm)],[c_54,c_118]) ).
cnf(c_134,plain,
capital_city(usa) != washington,
inference(unflattening,[status(thm)],[c_133]) ).
cnf(c_135,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_134,c_57]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.08 % Problem : PUZ132+1 : TPTP v8.1.2. Released v4.1.0.
% 0.02/0.09 % Command : run_iprover %s %d THM
% 0.09/0.28 % Computer : n032.cluster.edu
% 0.09/0.28 % Model : x86_64 x86_64
% 0.09/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.28 % Memory : 8042.1875MB
% 0.09/0.28 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.28 % CPULimit : 300
% 0.09/0.28 % WCLimit : 300
% 0.09/0.28 % DateTime : Thu May 2 21:14:23 EDT 2024
% 0.09/0.28 % CPUTime :
% 0.13/0.36 Running first-order theorem proving
% 0.13/0.36 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.60/0.99 % SZS status Started for theBenchmark.p
% 0.60/0.99 % SZS status Theorem for theBenchmark.p
% 0.60/0.99
% 0.60/0.99 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.60/0.99
% 0.60/0.99 ------ iProver source info
% 0.60/0.99
% 0.60/0.99 git: date: 2024-05-02 19:28:25 +0000
% 0.60/0.99 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 0.60/0.99 git: non_committed_changes: false
% 0.60/0.99
% 0.60/0.99 ------ Parsing...
% 0.60/0.99 ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.60/0.99
% 0.60/0.99 ------ Preprocessing... sup_sim: 0 sf_s rm: 9 0s sf_e pe_s pe:1:0s
% 0.60/0.99
% 0.60/0.99 % SZS status Theorem for theBenchmark.p
% 0.60/0.99
% 0.60/0.99 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.60/0.99
% 0.60/0.99
%------------------------------------------------------------------------------