TSTP Solution File: PUZ132+1 by ConnectPP---0.3.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ConnectPP---0.3.0
% Problem : PUZ132+1 : TPTP v8.1.2. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : connect++ --verbosity 0 --no-colour --tptp-proof --schedule default %s
% Computer : n014.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 : Mon Mar 25 14:29:13 EDT 2024
% Result : Theorem 0.13s 0.34s
% Output : Proof 0.13s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : PUZ132+1 : TPTP v8.1.2. Released v4.1.0.
% 0.03/0.13 % Command : connect++ --verbosity 0 --no-colour --tptp-proof --schedule default %s
% 0.13/0.34 % Computer : n014.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Wed Mar 20 23:19:30 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.13/0.34 % SZS status Theorem for theBenchmark
% 0.13/0.34 % SZS output start Proof for theBenchmark
% 0.13/0.34
% 0.13/0.34 % Formula: capital_type ( axiom ) converted to clauses:
% 0.13/0.34 cnf(capital_type-1, axiom, ( capital(skolem1) )).
% 0.13/0.34
% 0.13/0.34 % Formula: city_type ( axiom ) converted to clauses:
% 0.13/0.34 cnf(city_type-1, axiom, ( city(skolem2) )).
% 0.13/0.34
% 0.13/0.34 % Formula: capital_city_type ( axiom ) converted to clauses:
% 0.13/0.34 cnf(capital_city_type-1, axiom, ( ~capital(_u2) | city(_u2) )).
% 0.13/0.34
% 0.13/0.34 % Formula: country_type ( axiom ) converted to clauses:
% 0.13/0.34 cnf(country_type-1, axiom, ( country(skolem3) )).
% 0.13/0.34
% 0.13/0.34 % Formula: washington_type ( axiom ) converted to clauses:
% 0.13/0.34 cnf(washington_type-1, axiom, ( capital(washington) )).
% 0.13/0.34
% 0.13/0.34 % Formula: usa_type ( axiom ) converted to clauses:
% 0.13/0.34 cnf(usa_type-1, axiom, ( country(usa) )).
% 0.13/0.34
% 0.13/0.34 % Formula: country_capital_type ( axiom ) converted to clauses:
% 0.13/0.34 cnf(country_capital_type-1, axiom, ( ~country(_u4) | capital(capital_city(_u4)) )).
% 0.13/0.34
% 0.13/0.34 % Formula: crime_axiom ( axiom ) converted to clauses:
% 0.13/0.34 cnf(crime_axiom-1, axiom, ( ~city(_u5) | has_crime(_u5) )).
% 0.13/0.34
% 0.13/0.34 % Formula: usa_capital_axiom ( axiom ) converted to clauses:
% 0.13/0.34 cnf(usa_capital_axiom-1, axiom, ( ( capital_city(usa) = washington) )).
% 0.13/0.34
% 0.13/0.34 % Formula: beautiful_capital_axiom ( axiom ) converted to clauses:
% 0.13/0.34 cnf(beautiful_capital_axiom-1, axiom, ( ~country(_u6) | beautiful(capital_city(_u6)) )).
% 0.13/0.34
% 0.13/0.34 % Formula: washington_conjecture ( conjecture ) (definitionally) converted to clauses:
% 0.13/0.34 cnf(washington_conjecture-1, negated_conjecture, ( ~beautiful(washington) | ~has_crime(washington) )).
% 0.13/0.34
% 0.13/0.34 % Problem matrix:
% 0.13/0.34 cnf(matrix-0, plain, ( ( __eqx_0 = __eqx_0) )).
% 0.13/0.34 cnf(matrix-1, plain, ( ( __eqx_0 != __eqx_1) | ( __eqx_1 = __eqx_0) )).
% 0.13/0.34 cnf(matrix-2, plain, ( ( __eqx_0 != __eqx_1) | ( __eqx_1 != __eqx_2) | ( __eqx_0 = __eqx_2) )).
% 0.13/0.34 cnf(matrix-3, plain, ( ( __eqx_0 != __eqy_0) | ( capital_city(__eqx_0) = capital_city(__eqy_0)) )).
% 0.13/0.34 cnf(matrix-4, plain, ( ( __eqx_0 != __eqy_0) | ~capital(__eqx_0) | capital(__eqy_0) )).
% 0.13/0.34 cnf(matrix-5, plain, ( ( __eqx_0 != __eqy_0) | ~city(__eqx_0) | city(__eqy_0) )).
% 0.13/0.34 cnf(matrix-6, plain, ( ( __eqx_0 != __eqy_0) | ~country(__eqx_0) | country(__eqy_0) )).
% 0.13/0.34 cnf(matrix-7, plain, ( ( __eqx_0 != __eqy_0) | ~has_crime(__eqx_0) | has_crime(__eqy_0) )).
% 0.13/0.34 cnf(matrix-8, plain, ( ( __eqx_0 != __eqy_0) | ~beautiful(__eqx_0) | beautiful(__eqy_0) )).
% 0.13/0.34 cnf(matrix-9, plain, ( capital(skolem1) )).
% 0.13/0.34 cnf(matrix-10, plain, ( city(skolem2) )).
% 0.13/0.34 cnf(matrix-11, plain, ( ~capital(_u2) | city(_u2) )).
% 0.13/0.34 cnf(matrix-12, plain, ( country(skolem3) )).
% 0.13/0.34 cnf(matrix-13, plain, ( capital(washington) )).
% 0.13/0.34 cnf(matrix-14, plain, ( country(usa) )).
% 0.13/0.34 cnf(matrix-15, plain, ( ~country(_u4) | capital(capital_city(_u4)) )).
% 0.13/0.34 cnf(matrix-16, plain, ( ~city(_u5) | has_crime(_u5) )).
% 0.13/0.34 cnf(matrix-17, plain, ( ( capital_city(usa) = washington) )).
% 0.13/0.34 cnf(matrix-18, plain, ( ~country(_u6) | beautiful(capital_city(_u6)) )).
% 0.13/0.34 cnf(matrix-19, plain, ( ~beautiful(washington) | ~has_crime(washington) )).
% 0.13/0.34
% 0.13/0.34 % Proof stack:
% 0.13/0.34 cnf(proof-stack, plain,
% 0.13/0.34 proof_stack(
% 0.13/0.34 start(19),
% 0.13/0.34 left_branch(0, 8, 2, 2),
% 0.13/0.34 left_branch(0, 17, 0, 3),
% 0.13/0.34 right_branch(3),
% 0.13/0.34 left_branch(0, 18, 1, 4),
% 0.13/0.34 left_branch(0, 14, 0, 5),
% 0.13/0.34 right_branch(5),
% 0.13/0.34 right_branch(4),
% 0.13/0.34 right_branch(2),
% 0.13/0.34 left_branch(0, 16, 1, 3),
% 0.13/0.34 left_branch(0, 11, 1, 4),
% 0.13/0.34 left_branch(0, 13, 0, 5),
% 0.13/0.34 right_branch(5),
% 0.13/0.34 right_branch(4),
% 0.13/0.34 right_branch(3)
% 0.13/0.34 )).
% 0.13/0.34 % SZS output end Proof for theBenchmark
%------------------------------------------------------------------------------