TSTP Solution File: SEU167+2 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : SEU167+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% Computer : n006.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 11:53:43 EDT 2022
% Result : Theorem 2.09s 0.64s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : SEU167+2 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.12 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.12/0.33 % Computer : n006.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Mon Jun 20 09:59:40 EDT 2022
% 0.12/0.33 % CPUTime :
% 2.09/0.64 % SZS status Theorem
% 2.09/0.64 % SZS output begin IncompleteProof
% 2.09/0.64 cnf(c0, axiom,
% 2.09/0.64 subset(sK31,sK32)).
% 2.09/0.64 cnf(c1, plain,
% 2.09/0.64 subset(sK31,sK32),
% 2.09/0.64 inference(start, [], [c0])).
% 2.09/0.64
% 2.09/0.64 cnf(c2, axiom,
% 2.09/0.64 subset(cartesian_product2(X0,X1),cartesian_product2(X0,X2)) | ~subset(X1,X2)).
% 2.09/0.64 cnf(a0, assumption,
% 2.09/0.64 sK31 = X1).
% 2.09/0.64 cnf(a1, assumption,
% 2.09/0.64 sK32 = X2).
% 2.09/0.64 cnf(c3, plain,
% 2.09/0.64 $false,
% 2.09/0.64 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 2.09/0.64 cnf(c4, plain,
% 2.09/0.64 subset(cartesian_product2(X0,X1),cartesian_product2(X0,X2)),
% 2.09/0.64 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 2.09/0.64
% 2.09/0.64 cnf(c5, axiom,
% 2.09/0.64 subset(X3,X4) | ~subset(X5,X4) | ~subset(X3,X5)).
% 2.09/0.64 cnf(a2, assumption,
% 2.09/0.64 cartesian_product2(X0,X1) = X3).
% 2.09/0.64 cnf(a3, assumption,
% 2.09/0.64 cartesian_product2(X0,X2) = X5).
% 2.09/0.64 cnf(c6, plain,
% 2.09/0.64 $false,
% 2.09/0.64 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 2.09/0.64 cnf(c7, plain,
% 2.09/0.64 subset(X3,X4) | ~subset(X5,X4),
% 2.09/0.64 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 2.09/0.64
% 2.09/0.64 cnf(c8, axiom,
% 2.09/0.64 ~subset(cartesian_product2(sK29,sK31),cartesian_product2(sK30,sK32))).
% 2.09/0.64 cnf(a4, assumption,
% 2.09/0.64 X3 = cartesian_product2(sK29,sK31)).
% 2.09/0.64 cnf(a5, assumption,
% 2.09/0.64 X4 = cartesian_product2(sK30,sK32)).
% 2.09/0.64 cnf(c9, plain,
% 2.09/0.64 ~subset(X5,X4),
% 2.09/0.64 inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])).
% 2.09/0.64 cnf(c10, plain,
% 2.09/0.64 $false,
% 2.09/0.64 inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])).
% 2.09/0.64
% 2.09/0.64 cnf(c11, axiom,
% 2.09/0.64 subset(cartesian_product2(X6,X7),cartesian_product2(X8,X7)) | ~subset(X6,X8)).
% 2.09/0.64 cnf(a6, assumption,
% 2.09/0.64 X5 = cartesian_product2(X6,X7)).
% 2.09/0.64 cnf(a7, assumption,
% 2.09/0.64 X4 = cartesian_product2(X8,X7)).
% 2.09/0.64 cnf(c12, plain,
% 2.09/0.64 $false,
% 2.09/0.64 inference(strict_predicate_extension, [assumptions([a6, a7])], [c9, c11])).
% 2.09/0.64 cnf(c13, plain,
% 2.09/0.64 ~subset(X6,X8),
% 2.09/0.64 inference(strict_predicate_extension, [assumptions([a6, a7])], [c9, c11])).
% 2.09/0.64
% 2.09/0.64 cnf(c14, axiom,
% 2.09/0.64 subset(sK29,sK30)).
% 2.09/0.64 cnf(a8, assumption,
% 2.09/0.64 X6 = sK29).
% 2.09/0.64 cnf(a9, assumption,
% 2.09/0.64 X8 = sK30).
% 2.09/0.64 cnf(c15, plain,
% 2.09/0.64 $false,
% 2.09/0.64 inference(strict_predicate_extension, [assumptions([a8, a9])], [c13, c14])).
% 2.09/0.64 cnf(c16, plain,
% 2.09/0.64 $false,
% 2.09/0.64 inference(strict_predicate_extension, [assumptions([a8, a9])], [c13, c14])).
% 2.09/0.64
% 2.09/0.64 cnf(c17, plain,
% 2.09/0.64 $false,
% 2.09/0.64 inference(constraint_solving, [
% 2.09/0.64 bind(X0, sK29),
% 2.09/0.64 bind(X1, sK31),
% 2.09/0.64 bind(X2, sK32),
% 2.09/0.64 bind(X3, cartesian_product2(X0,X1)),
% 2.09/0.64 bind(X4, cartesian_product2(sK30,sK32)),
% 2.09/0.64 bind(X5, cartesian_product2(X0,X2)),
% 2.09/0.64 bind(X6, sK29),
% 2.09/0.64 bind(X7, sK32),
% 2.09/0.64 bind(X8, sK30)
% 2.09/0.64 ],
% 2.09/0.64 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9])).
% 2.09/0.64
% 2.09/0.64 % SZS output end IncompleteProof
%------------------------------------------------------------------------------