%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : PUZ132+1 : TPTP v9.3.1. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n013.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 08:54:31 AM UTC 2026
% Result : Theorem 0.14s 10.62s
% Output : Proof 0.14s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
fof(capital_type,axiom,
? [A] : capital(A),
file('theBenchmark.p',capital_type) ).
fof(city_type,axiom,
? [A] : city(A),
file('theBenchmark.p',city_type) ).
fof(capital_city_type,axiom,
! [A] :
( capital(A)
=> city(A) ),
file('theBenchmark.p',capital_city_type) ).
fof(country_type,axiom,
? [A] : country(A),
file('theBenchmark.p',country_type) ).
fof(washington_type,axiom,
capital(washington),
file('theBenchmark.p',washington_type) ).
fof(usa_type,axiom,
country(usa),
file('theBenchmark.p',usa_type) ).
fof(country_capital_type,axiom,
! [A] :
( country(A)
=> capital(capital_city(A)) ),
file('theBenchmark.p',country_capital_type) ).
fof(crime_axiom,axiom,
! [X] :
( city(X)
=> has_crime(X) ),
file('theBenchmark.p',crime_axiom) ).
fof(usa_capital_axiom,axiom,
capital_city(usa) = washington,
file('theBenchmark.p',usa_capital_axiom) ).
fof(beautiful_capital_axiom,axiom,
! [X] :
( country(X)
=> beautiful(capital_city(X)) ),
file('theBenchmark.p',beautiful_capital_axiom) ).
fof(washington_conjecture,conjecture,
( has_crime(washington)
& beautiful(washington) ),
file('theBenchmark.p',washington_conjecture) ).
fof(f_1_1,plain,
? [A] : capital(A),
inference(fof_nnf,[status(thm)],[capital_type]) ).
fof(f_1_2,plain,
? [U_0] : capital(U_0),
inference(variable_rename,[status(thm)],[f_1_1]) ).
fof(f_1_3,plain,
capital(sK1),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(U_0,sK1)],[f_1_2]) ).
cnf(f_1_4,plain,
capital(sK1),
inference(clausify,[status(thm)],[f_1_3]) ).
fof(f_2_1,plain,
? [A] : city(A),
inference(fof_nnf,[status(thm)],[city_type]) ).
fof(f_2_2,plain,
? [U_1] : city(U_1),
inference(variable_rename,[status(thm)],[f_2_1]) ).
fof(f_2_3,plain,
city(sK2),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(U_1,sK2)],[f_2_2]) ).
cnf(f_2_4,plain,
city(sK2),
inference(clausify,[status(thm)],[f_2_3]) ).
fof(f_3_1,plain,
! [A] :
( city(A)
| ~ capital(A) ),
inference(fof_nnf,[status(thm)],[capital_city_type]) ).
fof(f_3_2,plain,
! [U_2] :
( city(U_2)
| ~ capital(U_2) ),
inference(variable_rename,[status(thm)],[f_3_1]) ).
cnf(f_3_3,plain,
( city(U_2)
| ~ capital(U_2) ),
inference(clausify,[status(thm)],[f_3_2]) ).
fof(f_4_1,plain,
? [A] : country(A),
inference(fof_nnf,[status(thm)],[country_type]) ).
fof(f_4_2,plain,
? [U_3] : country(U_3),
inference(variable_rename,[status(thm)],[f_4_1]) ).
fof(f_4_3,plain,
country(sK3),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3]),skolemize(U_3,sK3)],[f_4_2]) ).
cnf(f_4_4,plain,
country(sK3),
inference(clausify,[status(thm)],[f_4_3]) ).
fof(f_5_1,plain,
capital(washington),
inference(fof_nnf,[status(thm)],[washington_type]) ).
cnf(f_5_2,plain,
capital(washington),
inference(clausify,[status(thm)],[f_5_1]) ).
fof(f_6_1,plain,
country(usa),
inference(fof_nnf,[status(thm)],[usa_type]) ).
cnf(f_6_2,plain,
country(usa),
inference(clausify,[status(thm)],[f_6_1]) ).
fof(f_7_1,plain,
! [A] :
( capital(capital_city(A))
| ~ country(A) ),
inference(fof_nnf,[status(thm)],[country_capital_type]) ).
fof(f_7_2,plain,
! [U_4] :
( capital(capital_city(U_4))
| ~ country(U_4) ),
inference(variable_rename,[status(thm)],[f_7_1]) ).
cnf(f_7_3,plain,
( capital(capital_city(U_4))
| ~ country(U_4) ),
inference(clausify,[status(thm)],[f_7_2]) ).
fof(f_8_1,plain,
! [X] :
( has_crime(X)
| ~ city(X) ),
inference(fof_nnf,[status(thm)],[crime_axiom]) ).
fof(f_8_2,plain,
! [U_5] :
( has_crime(U_5)
| ~ city(U_5) ),
inference(variable_rename,[status(thm)],[f_8_1]) ).
cnf(f_8_3,plain,
( has_crime(U_5)
| ~ city(U_5) ),
inference(clausify,[status(thm)],[f_8_2]) ).
fof(f_9_1,plain,
capital_city(usa) = washington,
inference(fof_nnf,[status(thm)],[usa_capital_axiom]) ).
cnf(f_9_2,plain,
capital_city(usa) = washington,
inference(clausify,[status(thm)],[f_9_1]) ).
fof(f_10_1,plain,
! [X] :
( beautiful(capital_city(X))
| ~ country(X) ),
inference(fof_nnf,[status(thm)],[beautiful_capital_axiom]) ).
fof(f_10_2,plain,
! [U_6] :
( beautiful(capital_city(U_6))
| ~ country(U_6) ),
inference(variable_rename,[status(thm)],[f_10_1]) ).
cnf(f_10_3,plain,
( beautiful(capital_city(U_6))
| ~ country(U_6) ),
inference(clausify,[status(thm)],[f_10_2]) ).
fof(f_11_1,negated_conjecture,
~ ( has_crime(washington)
& beautiful(washington) ),
inference(negate,[status(cth)],[washington_conjecture]) ).
fof(f_11_2,negated_conjecture,
( ~ has_crime(washington)
| ~ beautiful(washington) ),
inference(fof_nnf,[status(thm)],[f_11_1]) ).
fof(f_11_3,negated_conjecture,
( ~ has_crime(washington)
| ~ beautiful(washington) ),
inference(definitional_conversion,[status(esa)],[f_11_2]) ).
cnf(f_11_4,negated_conjecture,
( ~ has_crime(washington)
| ~ beautiful(washington) ),
inference(clausify,[status(thm)],[f_11_3]) ).
cnf(equality_1,axiom,
Eq_x_0 = Eq_x_0,
theory(equality,[reflexivity]) ).
cnf(equality_2,axiom,
( Eq_x_1 = Eq_x_0
| Eq_x_0 != Eq_x_1 ),
theory(equality,[symmetry]) ).
cnf(equality_3,axiom,
( Eq_x_0 = Eq_x_2
| Eq_x_1 != Eq_x_2
| Eq_x_0 != Eq_x_1 ),
theory(equality,[transitivity]) ).
cnf(equality_4,axiom,
( capital_city(Eq_x_0) = capital_city(Eq_y_0)
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_functions]) ).
cnf(equality_5,axiom,
( capital(Eq_y_0)
| ~ capital(Eq_x_0)
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_predicates]) ).
cnf(equality_6,axiom,
( city(Eq_y_0)
| ~ city(Eq_x_0)
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_predicates]) ).
cnf(equality_7,axiom,
( country(Eq_y_0)
| ~ country(Eq_x_0)
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_predicates]) ).
cnf(equality_8,axiom,
( has_crime(Eq_y_0)
| ~ has_crime(Eq_x_0)
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_predicates]) ).
cnf(equality_9,axiom,
( beautiful(Eq_y_0)
| ~ beautiful(Eq_x_0)
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_predicates]) ).
cnf(sat_proved,plain,
$false,
inference(cadical,[status(thm)],[]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.23 % Problem : PUZ132+1 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.24 This is a FOF_THM_RFO_SEQ problem
% 0.00/0.24 % Command : /export/starexec/sandbox/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/10.59 % Computer : n013.cluster.edu
% 0.09/10.59 % Model : x86_64 x86_64
% 0.09/10.59 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/10.59 % Memory : 8046.5625MB
% 0.09/10.59 % OS : Linux 6.8.0-71-generic
% 0.09/10.59 % CPULimit : 300
% 0.09/10.59 % WCLimit : 300
% 0.09/10.59 % DateTime : Sat Sep 19 20:04:18 UTC 2026
% 0.14/10.60 % CPUTime :
% 0.14/10.62 % SZS status Theorem for theBenchmark
% 0.14/10.62 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------