TSTP Solution File: SET954+1 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : SET954+1 : TPTP v8.1.0. Released v3.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 : n019.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:49:25 EDT 2022
% Result : Theorem 0.13s 0.35s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SET954+1 : TPTP v8.1.0. Released v3.2.0.
% 0.04/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.13/0.34 % Computer : n019.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 : 600
% 0.13/0.34 % DateTime : Sat Jul 9 17:40:08 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.35 % SZS status Theorem
% 0.13/0.35 % SZS output begin IncompleteProof
% 0.13/0.35 cnf(c0, axiom,
% 0.13/0.35 in(unordered_pair(unordered_pair(sK2,sK3),singleton(sK2)),cartesian_product2(sK4,sK5))).
% 0.13/0.35 cnf(c1, plain,
% 0.13/0.35 in(unordered_pair(unordered_pair(sK2,sK3),singleton(sK2)),cartesian_product2(sK4,sK5)),
% 0.13/0.35 inference(start, [], [c0])).
% 0.13/0.35
% 0.13/0.35 cnf(c2, axiom,
% 0.13/0.35 in(X0,X1) | ~in(unordered_pair(unordered_pair(X2,X0),singleton(X2)),cartesian_product2(X3,X1))).
% 0.13/0.35 cnf(a0, assumption,
% 0.13/0.35 unordered_pair(unordered_pair(sK2,sK3),singleton(sK2)) = unordered_pair(unordered_pair(X2,X0),singleton(X2))).
% 0.13/0.35 cnf(a1, assumption,
% 0.13/0.35 cartesian_product2(sK4,sK5) = cartesian_product2(X3,X1)).
% 0.13/0.35 cnf(c3, plain,
% 0.13/0.35 $false,
% 0.13/0.35 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.13/0.35 cnf(c4, plain,
% 0.13/0.35 in(X0,X1),
% 0.13/0.35 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.13/0.35
% 0.13/0.35 cnf(c5, axiom,
% 0.13/0.35 in(unordered_pair(unordered_pair(X4,X5),singleton(X4)),cartesian_product2(X6,X7)) | ~in(X5,X7) | ~in(X4,X6)).
% 0.13/0.35 cnf(a2, assumption,
% 0.13/0.35 X0 = X4).
% 0.13/0.35 cnf(a3, assumption,
% 0.13/0.35 X1 = X6).
% 0.13/0.35 cnf(c6, plain,
% 0.13/0.35 $false,
% 0.13/0.35 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 0.13/0.35 cnf(c7, plain,
% 0.13/0.35 in(unordered_pair(unordered_pair(X4,X5),singleton(X4)),cartesian_product2(X6,X7)) | ~in(X5,X7),
% 0.13/0.35 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 0.13/0.35
% 0.13/0.35 cnf(c8, axiom,
% 0.13/0.35 ~in(unordered_pair(unordered_pair(sK3,sK2),singleton(sK3)),cartesian_product2(sK5,sK4))).
% 0.13/0.35 cnf(a4, assumption,
% 0.13/0.35 unordered_pair(unordered_pair(X4,X5),singleton(X4)) = unordered_pair(unordered_pair(sK3,sK2),singleton(sK3))).
% 0.13/0.35 cnf(a5, assumption,
% 0.13/0.35 cartesian_product2(X6,X7) = cartesian_product2(sK5,sK4)).
% 0.13/0.35 cnf(c9, plain,
% 0.13/0.35 ~in(X5,X7),
% 0.13/0.35 inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])).
% 0.13/0.35 cnf(c10, plain,
% 0.13/0.35 $false,
% 0.13/0.35 inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])).
% 0.13/0.35
% 0.13/0.35 cnf(c11, axiom,
% 0.13/0.35 in(X8,X9) | ~in(unordered_pair(unordered_pair(X8,X10),singleton(X8)),cartesian_product2(X9,X11))).
% 0.13/0.35 cnf(a6, assumption,
% 0.13/0.35 X5 = X8).
% 0.13/0.35 cnf(a7, assumption,
% 0.13/0.35 X7 = X9).
% 0.13/0.35 cnf(c12, plain,
% 0.13/0.35 $false,
% 0.13/0.35 inference(strict_predicate_extension, [assumptions([a6, a7])], [c9, c11])).
% 0.13/0.35 cnf(c13, plain,
% 0.13/0.35 ~in(unordered_pair(unordered_pair(X8,X10),singleton(X8)),cartesian_product2(X9,X11)),
% 0.13/0.35 inference(strict_predicate_extension, [assumptions([a6, a7])], [c9, c11])).
% 0.13/0.35
% 0.13/0.35 cnf(c14, plain,
% 0.13/0.35 in(unordered_pair(unordered_pair(sK2,sK3),singleton(sK2)),cartesian_product2(sK4,sK5))).
% 0.13/0.35 cnf(a8, assumption,
% 0.13/0.35 unordered_pair(unordered_pair(X8,X10),singleton(X8)) = unordered_pair(unordered_pair(sK2,sK3),singleton(sK2))).
% 0.13/0.35 cnf(a9, assumption,
% 0.13/0.35 cartesian_product2(X9,X11) = cartesian_product2(sK4,sK5)).
% 0.13/0.35 cnf(c15, plain,
% 0.13/0.35 $false,
% 0.13/0.35 inference(predicate_reduction, [assumptions([a8, a9])], [c13, c14])).
% 0.13/0.35
% 0.13/0.35 cnf(c16, plain,
% 0.13/0.35 $false,
% 0.13/0.35 inference(constraint_solving, [
% 0.13/0.35 bind(X0, sK3),
% 0.13/0.35 bind(X1, sK5),
% 0.13/0.35 bind(X2, sK2),
% 0.13/0.35 bind(X3, sK4),
% 0.13/0.35 bind(X4, sK3),
% 0.13/0.35 bind(X5, sK2),
% 0.13/0.35 bind(X6, sK5),
% 0.13/0.35 bind(X7, sK4),
% 0.13/0.35 bind(X8, sK2),
% 0.13/0.35 bind(X9, sK4),
% 0.13/0.35 bind(X10, sK3),
% 0.13/0.35 bind(X11, sK5)
% 0.13/0.35 ],
% 0.13/0.35 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9])).
% 0.13/0.35
% 0.13/0.35 % SZS output end IncompleteProof
%------------------------------------------------------------------------------