TSTP Solution File: SET676+3 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : SET676+3 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% Computer : n015.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 : Tue Jul 19 02:47:34 EDT 2022
% Result : Theorem 0.19s 0.36s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET676+3 : TPTP v8.1.0. Released v2.2.0.
% 0.03/0.12 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.13/0.33 % Computer : n015.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 Jul 10 12:33:08 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.19/0.36 % SZS status Theorem
% 0.19/0.36 % SZS output begin IncompleteProof
% 0.19/0.36 cnf(c0, axiom,
% 0.19/0.36 ilf_type(sK20,set_type)).
% 0.19/0.36 cnf(c1, plain,
% 0.19/0.36 ilf_type(sK20,set_type),
% 0.19/0.36 inference(start, [], [c0])).
% 0.19/0.36
% 0.19/0.36 cnf(c2, axiom,
% 0.19/0.36 ilf_type(X0,identity_relation_of_type(X1)) | ~ilf_type(X0,relation_type(X1,X1)) | ~ilf_type(X0,set_type) | ~ilf_type(X1,set_type)).
% 0.19/0.36 cnf(a0, assumption,
% 0.19/0.36 sK20 = X1).
% 0.19/0.36 cnf(a1, assumption,
% 0.19/0.36 set_type = set_type).
% 0.19/0.36 cnf(c3, plain,
% 0.19/0.36 $false,
% 0.19/0.36 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.19/0.36 cnf(c4, plain,
% 0.19/0.36 ilf_type(X0,identity_relation_of_type(X1)) | ~ilf_type(X0,relation_type(X1,X1)) | ~ilf_type(X0,set_type),
% 0.19/0.36 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.19/0.36
% 0.19/0.36 cnf(c5, axiom,
% 0.19/0.36 ~ilf_type(cross_product(sK20,sK20),identity_relation_of_type(sK20))).
% 0.19/0.36 cnf(a2, assumption,
% 0.19/0.36 X0 = cross_product(sK20,sK20)).
% 0.19/0.36 cnf(a3, assumption,
% 0.19/0.36 identity_relation_of_type(X1) = identity_relation_of_type(sK20)).
% 0.19/0.36 cnf(c6, plain,
% 0.19/0.36 ~ilf_type(X0,relation_type(X1,X1)) | ~ilf_type(X0,set_type),
% 0.19/0.36 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 0.19/0.36 cnf(c7, plain,
% 0.19/0.36 $false,
% 0.19/0.36 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 0.19/0.36
% 0.19/0.36 cnf(c8, axiom,
% 0.19/0.36 ilf_type(cross_product(X2,X3),relation_type(X2,X3)) | ~ilf_type(X3,set_type) | ~ilf_type(X2,set_type)).
% 0.19/0.36 cnf(a4, assumption,
% 0.19/0.36 X0 = cross_product(X2,X3)).
% 0.19/0.36 cnf(a5, assumption,
% 0.19/0.36 relation_type(X1,X1) = relation_type(X2,X3)).
% 0.19/0.36 cnf(c9, plain,
% 0.19/0.36 ~ilf_type(X0,set_type),
% 0.19/0.36 inference(strict_predicate_extension, [assumptions([a4, a5])], [c6, c8])).
% 0.19/0.36 cnf(c10, plain,
% 0.19/0.36 ~ilf_type(X3,set_type) | ~ilf_type(X2,set_type),
% 0.19/0.36 inference(strict_predicate_extension, [assumptions([a4, a5])], [c6, c8])).
% 0.19/0.36
% 0.19/0.36 cnf(c11, plain,
% 0.19/0.36 ilf_type(sK20,set_type)).
% 0.19/0.36 cnf(a6, assumption,
% 0.19/0.36 X3 = sK20).
% 0.19/0.36 cnf(a7, assumption,
% 0.19/0.36 set_type = set_type).
% 0.19/0.36 cnf(c12, plain,
% 0.19/0.36 ~ilf_type(X2,set_type),
% 0.19/0.36 inference(predicate_reduction, [assumptions([a6, a7])], [c10, c11])).
% 0.19/0.36
% 0.19/0.36 cnf(c13, plain,
% 0.19/0.36 ilf_type(sK20,set_type)).
% 0.19/0.36 cnf(a8, assumption,
% 0.19/0.36 X2 = sK20).
% 0.19/0.36 cnf(a9, assumption,
% 0.19/0.36 set_type = set_type).
% 0.19/0.36 cnf(c14, plain,
% 0.19/0.36 $false,
% 0.19/0.36 inference(predicate_reduction, [assumptions([a8, a9])], [c12, c13])).
% 0.19/0.36
% 0.19/0.36 cnf(c15, axiom,
% 0.19/0.36 ilf_type(X4,set_type)).
% 0.19/0.36 cnf(a10, assumption,
% 0.19/0.36 X0 = X4).
% 0.19/0.36 cnf(a11, assumption,
% 0.19/0.36 set_type = set_type).
% 0.19/0.36 cnf(c16, plain,
% 0.19/0.36 $false,
% 0.19/0.36 inference(strict_predicate_extension, [assumptions([a10, a11])], [c9, c15])).
% 0.19/0.36 cnf(c17, plain,
% 0.19/0.36 $false,
% 0.19/0.36 inference(strict_predicate_extension, [assumptions([a10, a11])], [c9, c15])).
% 0.19/0.36
% 0.19/0.36 cnf(c18, plain,
% 0.19/0.36 $false,
% 0.19/0.36 inference(constraint_solving, [
% 0.19/0.36 bind(X0, cross_product(sK20,sK20)),
% 0.19/0.36 bind(X1, sK20),
% 0.19/0.36 bind(X2, sK20),
% 0.19/0.36 bind(X3, sK20),
% 0.19/0.36 bind(X4, cross_product(sK20,sK20))
% 0.19/0.36 ],
% 0.19/0.36 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11])).
% 0.19/0.36
% 0.19/0.36 % SZS output end IncompleteProof
%------------------------------------------------------------------------------