TSTP Solution File: PUZ132+1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : PUZ132+1 : TPTP v8.1.2. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% Computer : n024.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 Aug 31 13:12:43 EDT 2023
% Result : Theorem 0.21s 0.58s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 18
% Syntax : Number of formulae : 34 ( 10 unt; 11 typ; 0 def)
% Number of atoms : 36 ( 2 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 26 ( 13 ~; 8 |; 2 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 6 ( 6 >; 0 *; 0 +; 0 <<)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-1 aty)
% Number of variables : 9 ( 0 sgn; 6 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
capital: $i > $o ).
tff(decl_23,type,
city: $i > $o ).
tff(decl_24,type,
country: $i > $o ).
tff(decl_25,type,
washington: $i ).
tff(decl_26,type,
usa: $i ).
tff(decl_27,type,
capital_city: $i > $i ).
tff(decl_28,type,
has_crime: $i > $o ).
tff(decl_29,type,
beautiful: $i > $o ).
tff(decl_30,type,
esk1_0: $i ).
tff(decl_31,type,
esk2_0: $i ).
tff(decl_32,type,
esk3_0: $i ).
fof(washington_conjecture,conjecture,
( beautiful(washington)
& has_crime(washington) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',washington_conjecture) ).
fof(beautiful_capital_axiom,axiom,
! [X2] :
( country(X2)
=> beautiful(capital_city(X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',beautiful_capital_axiom) ).
fof(usa_capital_axiom,axiom,
capital_city(usa) = washington,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',usa_capital_axiom) ).
fof(usa_type,axiom,
country(usa),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',usa_type) ).
fof(crime_axiom,axiom,
! [X2] :
( city(X2)
=> has_crime(X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',crime_axiom) ).
fof(capital_city_type,axiom,
! [X1] :
( capital(X1)
=> city(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',capital_city_type) ).
fof(washington_type,axiom,
capital(washington),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',washington_type) ).
fof(c_0_7,negated_conjecture,
~ ( beautiful(washington)
& has_crime(washington) ),
inference(assume_negation,[status(cth)],[washington_conjecture]) ).
fof(c_0_8,plain,
! [X9] :
( ~ country(X9)
| beautiful(capital_city(X9)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[beautiful_capital_axiom])]) ).
fof(c_0_9,negated_conjecture,
( ~ beautiful(washington)
| ~ has_crime(washington) ),
inference(fof_nnf,[status(thm)],[c_0_7]) ).
cnf(c_0_10,plain,
( beautiful(capital_city(X1))
| ~ country(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_11,plain,
capital_city(usa) = washington,
inference(split_conjunct,[status(thm)],[usa_capital_axiom]) ).
cnf(c_0_12,plain,
country(usa),
inference(split_conjunct,[status(thm)],[usa_type]) ).
cnf(c_0_13,negated_conjecture,
( ~ beautiful(washington)
| ~ has_crime(washington) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,plain,
beautiful(washington),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12])]) ).
fof(c_0_15,plain,
! [X8] :
( ~ city(X8)
| has_crime(X8) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[crime_axiom])]) ).
cnf(c_0_16,negated_conjecture,
~ has_crime(washington),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_14])]) ).
cnf(c_0_17,plain,
( has_crime(X1)
| ~ city(X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_18,plain,
! [X5] :
( ~ capital(X5)
| city(X5) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[capital_city_type])]) ).
cnf(c_0_19,negated_conjecture,
~ city(washington),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,plain,
( city(X1)
| ~ capital(X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_21,plain,
capital(washington),
inference(split_conjunct,[status(thm)],[washington_type]) ).
cnf(c_0_22,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : PUZ132+1 : TPTP v8.1.2. Released v4.1.0.
% 0.11/0.14 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.15/0.35 % Computer : n024.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Sat Aug 26 22:46:24 EDT 2023
% 0.15/0.35 % CPUTime :
% 0.21/0.56 start to proof: theBenchmark
% 0.21/0.58 % Version : CSE_E---1.5
% 0.21/0.58 % Problem : theBenchmark.p
% 0.21/0.58 % Proof found
% 0.21/0.58 % SZS status Theorem for theBenchmark.p
% 0.21/0.58 % SZS output start Proof
% See solution above
% 0.21/0.58 % Total time : 0.006000 s
% 0.21/0.58 % SZS output end Proof
% 0.21/0.58 % Total time : 0.008000 s
%------------------------------------------------------------------------------