TSTP Solution File: PUZ132+1 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : PUZ132+1 : TPTP v8.1.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% Computer : n021.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 : 600s
% DateTime : Mon Jul 18 18:19:02 EDT 2022
% Result : Theorem 0.13s 0.34s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : PUZ132+1 : TPTP v8.1.0. Released v4.1.0.
% 0.06/0.12 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.13/0.33 % Computer : n021.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Sun May 29 02:12:27 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.13/0.34 % SZS status Theorem
% 0.13/0.34 % SZS output begin IncompleteProof
% 0.13/0.34 cnf(c0, axiom,
% 0.13/0.34 ~has_crime(washington) | ~beautiful(washington)).
% 0.13/0.34 cnf(c1, plain,
% 0.13/0.34 ~has_crime(washington) | ~beautiful(washington),
% 0.13/0.34 inference(start, [], [c0])).
% 0.13/0.34
% 0.13/0.34 cnf(c2, axiom,
% 0.13/0.34 has_crime(X0) | ~city(X0)).
% 0.13/0.34 cnf(a0, assumption,
% 0.13/0.34 washington = X0).
% 0.13/0.34 cnf(c3, plain,
% 0.13/0.34 ~beautiful(washington),
% 0.13/0.34 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 0.13/0.34 cnf(c4, plain,
% 0.13/0.34 ~city(X0),
% 0.13/0.34 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 0.13/0.34
% 0.13/0.34 cnf(c5, axiom,
% 0.13/0.34 city(X1) | ~capital(X1)).
% 0.13/0.34 cnf(a1, assumption,
% 0.13/0.34 X0 = X1).
% 0.13/0.34 cnf(c6, plain,
% 0.13/0.34 $false,
% 0.13/0.34 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])).
% 0.13/0.34 cnf(c7, plain,
% 0.13/0.34 ~capital(X1),
% 0.13/0.34 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])).
% 0.13/0.34
% 0.13/0.34 cnf(c8, axiom,
% 0.13/0.34 capital(washington)).
% 0.13/0.34 cnf(a2, assumption,
% 0.13/0.34 X1 = washington).
% 0.13/0.34 cnf(c9, plain,
% 0.13/0.34 $false,
% 0.13/0.34 inference(strict_predicate_extension, [assumptions([a2])], [c7, c8])).
% 0.13/0.34 cnf(c10, plain,
% 0.13/0.34 $false,
% 0.13/0.34 inference(strict_predicate_extension, [assumptions([a2])], [c7, c8])).
% 0.13/0.34
% 0.13/0.34 cnf(c11, axiom,
% 0.13/0.34 beautiful(capital_city(X2)) | ~country(X2)).
% 0.13/0.34 cnf(a3, assumption,
% 0.13/0.34 X3 = washington).
% 0.13/0.34 cnf(c12, plain,
% 0.13/0.34 $false,
% 0.13/0.34 inference(lazy_predicate_extension, [assumptions([a3])], [c3, c11])).
% 0.13/0.34 cnf(c13, plain,
% 0.13/0.34 ~country(X2),
% 0.13/0.34 inference(lazy_predicate_extension, [assumptions([a3])], [c3, c11])).
% 0.13/0.34 cnf(c14, plain,
% 0.13/0.34 capital_city(X2) != X3,
% 0.13/0.34 inference(lazy_predicate_extension, [assumptions([a3])], [c3, c11])).
% 0.13/0.34
% 0.13/0.34 cnf(c15, axiom,
% 0.13/0.34 washington = capital_city(usa)).
% 0.13/0.34 cnf(a4, assumption,
% 0.13/0.34 capital_city(X2) = capital_city(usa)).
% 0.13/0.34 cnf(c16, plain,
% 0.13/0.34 $false,
% 0.13/0.34 inference(strict_function_extension, [assumptions([a4])], [c14, c15])).
% 0.13/0.34 cnf(c17, plain,
% 0.13/0.34 $false,
% 0.13/0.34 inference(strict_function_extension, [assumptions([a4])], [c14, c15])).
% 0.13/0.34 cnf(c18, plain,
% 0.13/0.34 X4 != washington | X4 != X3,
% 0.13/0.34 inference(strict_function_extension, [assumptions([a4])], [c14, c15])).
% 0.13/0.34
% 0.13/0.34 cnf(a5, assumption,
% 0.13/0.34 X4 = washington).
% 0.13/0.34 cnf(c19, plain,
% 0.13/0.34 X4 != X3,
% 0.13/0.34 inference(reflexivity, [assumptions([a5])], [c18])).
% 0.13/0.34
% 0.13/0.34 cnf(a6, assumption,
% 0.13/0.34 X4 = X3).
% 0.13/0.34 cnf(c20, plain,
% 0.13/0.34 $false,
% 0.13/0.34 inference(reflexivity, [assumptions([a6])], [c19])).
% 0.13/0.34
% 0.13/0.34 cnf(c21, axiom,
% 0.13/0.34 country(usa)).
% 0.13/0.34 cnf(a7, assumption,
% 0.13/0.34 X2 = usa).
% 0.13/0.34 cnf(c22, plain,
% 0.13/0.34 $false,
% 0.13/0.34 inference(strict_predicate_extension, [assumptions([a7])], [c13, c21])).
% 0.13/0.34 cnf(c23, plain,
% 0.13/0.34 $false,
% 0.13/0.34 inference(strict_predicate_extension, [assumptions([a7])], [c13, c21])).
% 0.13/0.34
% 0.13/0.34 cnf(c24, plain,
% 0.13/0.34 $false,
% 0.13/0.34 inference(constraint_solving, [
% 0.13/0.34 bind(X0, washington),
% 0.13/0.34 bind(X1, washington),
% 0.13/0.34 bind(X2, usa),
% 0.13/0.34 bind(X3, washington),
% 0.13/0.34 bind(X4, washington)
% 0.13/0.34 ],
% 0.13/0.34 [a0, a1, a2, a3, a4, a5, a6, a7])).
% 0.13/0.34
% 0.13/0.34 % SZS output end IncompleteProof
%------------------------------------------------------------------------------