%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : SET016+4 : 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 : n016.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:42:24 EDT 2022 % Result : Theorem 281.93s 36.72s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : SET016+4 : 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.12/0.33 % Computer : n016.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 : Sun Jul 10 07:19:56 EDT 2022 % 0.12/0.33 % CPUTime : % 281.93/36.72 % SZS status Theorem % 281.93/36.72 % SZS output begin IncompleteProof % 281.93/36.72 cnf(c0, axiom, % 281.93/36.72 equal_set(unordered_pair(singleton(sK3),unordered_pair(sK3,sK4)),unordered_pair(singleton(sK5),unordered_pair(sK5,sK6)))). % 281.93/36.72 cnf(c1, plain, % 281.93/36.72 equal_set(unordered_pair(singleton(sK3),unordered_pair(sK3,sK4)),unordered_pair(singleton(sK5),unordered_pair(sK5,sK6))), % 281.93/36.72 inference(start, [], [c0])). % 281.93/36.72 % 281.93/36.72 cnf(c2, axiom, % 281.93/36.72 subset(X0,X1) | ~equal_set(X0,X1)). % 281.93/36.72 cnf(a0, assumption, % 281.93/36.72 unordered_pair(singleton(sK3),unordered_pair(sK3,sK4)) = X0). % 281.93/36.72 cnf(a1, assumption, % 281.93/36.72 unordered_pair(singleton(sK5),unordered_pair(sK5,sK6)) = X1). % 281.93/36.72 cnf(c3, plain, % 281.93/36.72 $false, % 281.93/36.72 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 281.93/36.72 cnf(c4, plain, % 281.93/36.72 subset(X0,X1), % 281.93/36.72 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 281.93/36.72 % 281.93/36.72 cnf(c5, axiom, % 281.93/36.72 member(X2,X3) | ~member(X2,X4) | ~subset(X4,X3)). % 281.93/36.72 cnf(a2, assumption, % 281.93/36.72 X0 = X4). % 281.93/36.72 cnf(a3, assumption, % 281.93/36.72 X1 = X3). % 281.93/36.72 cnf(c6, plain, % 281.93/36.72 $false, % 281.93/36.72 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])). % 281.93/36.72 cnf(c7, plain, % 281.93/36.72 member(X2,X3) | ~member(X2,X4), % 281.93/36.72 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])). % 281.93/36.72 % 281.93/36.72 cnf(c8, axiom, % 281.93/36.72 X5 = X6 | X5 = X7 | ~member(X5,unordered_pair(X7,X6))). % 281.93/36.72 cnf(a4, assumption, % 281.93/36.72 X2 = X5). % 281.93/36.72 cnf(a5, assumption, % 281.93/36.72 X3 = unordered_pair(X7,X6)). % 281.93/36.72 cnf(c9, plain, % 281.93/36.72 ~member(X2,X4), % 281.93/36.72 inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])). % 281.93/36.72 cnf(c10, plain, % 281.93/36.72 X5 = X6 | X5 = X7, % 281.93/36.72 inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])). % 281.93/36.72 % 281.93/36.72 cnf(c11, axiom, % 281.93/36.72 member(X8,unordered_pair(X8,X9))). % 281.93/36.72 cnf(a6, assumption, % 281.93/36.72 unordered_pair(X8,X9) = X6). % 281.93/36.72 cnf(c12, plain, % 281.93/36.72 X5 = X7, % 281.93/36.72 inference(strict_subterm_extension, [assumptions([a6])], [c10, c11])). % 281.93/36.72 cnf(c13, plain, % 281.93/36.72 $false, % 281.93/36.72 inference(strict_subterm_extension, [assumptions([a6])], [c10, c11])). % 281.93/36.72 cnf(c14, plain, % 281.93/36.72 member(X8,X5), % 281.93/36.72 inference(strict_subterm_extension, [assumptions([a6])], [c10, c11])). % 281.93/36.72 % 281.93/36.72 cnf(c15, axiom, % 281.93/36.72 X10 = X11 | ~member(X10,singleton(X11))). % 281.93/36.72 cnf(a7, assumption, % 281.93/36.72 X8 = X10). % 281.93/36.72 cnf(a8, assumption, % 281.93/36.72 X5 = singleton(X11)). % 281.93/36.72 cnf(c16, plain, % 281.93/36.72 $false, % 281.93/36.72 inference(strict_predicate_extension, [assumptions([a7, a8])], [c14, c15])). % 281.93/36.72 cnf(c17, plain, % 281.93/36.72 X10 = X11, % 281.93/36.72 inference(strict_predicate_extension, [assumptions([a7, a8])], [c14, c15])). % 281.93/36.72 % 281.93/36.72 cnf(c18, axiom, % 281.93/36.72 sK3 != sK5). % 281.93/36.72 cnf(a9, assumption, % 281.93/36.72 sK5 = X10). % 281.93/36.72 cnf(c19, plain, % 281.93/36.72 $false, % 281.93/36.72 inference(strict_subterm_extension, [assumptions([a9])], [c17, c18])). % 281.93/36.72 cnf(c20, plain, % 281.93/36.72 $false, % 281.93/36.72 inference(strict_subterm_extension, [assumptions([a9])], [c17, c18])). % 281.93/36.72 cnf(c21, plain, % 281.93/36.72 sK3 != X11, % 281.93/36.72 inference(strict_subterm_extension, [assumptions([a9])], [c17, c18])). % 281.93/36.72 % 281.93/36.72 cnf(a10, assumption, % 281.93/36.72 sK3 = X11). % 281.93/36.72 cnf(c22, plain, % 281.93/36.72 $false, % 281.93/36.72 inference(reflexivity, [assumptions([a10])], [c21])). % 281.93/36.72 % 281.93/36.72 cnf(c23, axiom, % 281.93/36.72 member(X12,singleton(X12))). % 281.93/36.72 cnf(a11, assumption, % 281.93/36.72 singleton(X12) = X7). % 281.93/36.72 cnf(c24, plain, % 281.93/36.72 $false, % 281.93/36.72 inference(strict_subterm_extension, [assumptions([a11])], [c12, c23])). % 281.93/36.72 cnf(c25, plain, % 281.93/36.72 $false, % 281.93/36.72 inference(strict_subterm_extension, [assumptions([a11])], [c12, c23])). % 281.93/36.72 cnf(c26, plain, % 281.93/36.72 member(X12,X5), % 281.93/36.72 inference(strict_subterm_extension, [assumptions([a11])], [c12, c23])). % 281.93/36.72 % 281.93/36.72 cnf(c27, plain, % 281.93/36.72 ~member(X8,X5)). % 281.93/36.72 cnf(a12, assumption, % 281.93/36.72 X12 = X8). % 281.93/36.72 cnf(a13, assumption, % 281.93/36.72 X5 = X5). % 281.93/36.72 cnf(c28, plain, % 281.93/36.72 $false, % 281.93/36.72 inference(predicate_reduction, [assumptions([a12, a13])], [c26, c27])). % 281.93/36.72 % 281.93/36.72 cnf(c29, axiom, % 281.93/36.72 member(X13,unordered_pair(X13,X14))). % 281.93/36.72 cnf(a14, assumption, % 281.93/36.72 X2 = X13). % 281.93/36.72 cnf(a15, assumption, % 281.93/36.72 X4 = unordered_pair(X13,X14)). % 281.93/36.72 cnf(c30, plain, % 281.93/36.72 $false, % 281.93/36.72 inference(strict_predicate_extension, [assumptions([a14, a15])], [c9, c29])). % 281.93/36.72 cnf(c31, plain, % 281.93/36.72 $false, % 281.93/36.72 inference(strict_predicate_extension, [assumptions([a14, a15])], [c9, c29])). % 281.93/36.72 % 281.93/36.72 cnf(c32, plain, % 281.93/36.72 $false, % 281.93/36.72 inference(constraint_solving, [ % 281.93/36.72 bind(X0, unordered_pair(singleton(sK3),unordered_pair(sK3,sK4))), % 281.93/36.72 bind(X1, unordered_pair(singleton(sK5),unordered_pair(sK5,sK6))), % 281.93/36.72 bind(X2, singleton(X11)), % 281.93/36.72 bind(X3, unordered_pair(singleton(sK5),unordered_pair(sK5,sK6))), % 281.93/36.72 bind(X4, unordered_pair(singleton(sK3),unordered_pair(sK3,sK4))), % 281.93/36.72 bind(X5, singleton(X11)), % 281.93/36.72 bind(X6, unordered_pair(sK5,sK6)), % 281.93/36.72 bind(X7, singleton(sK5)), % 281.93/36.72 bind(X8, sK5), % 281.93/36.72 bind(X9, sK6), % 281.93/36.72 bind(X10, sK5), % 281.93/36.72 bind(X11, sK3), % 281.93/36.72 bind(X12, sK5), % 281.93/36.72 bind(X13, singleton(X11)), % 281.93/36.72 bind(X14, unordered_pair(sK3,sK4)) % 281.93/36.72 ], % 281.93/36.72 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15])). % 281.93/36.72 % 281.93/36.72 % SZS output end IncompleteProof %------------------------------------------------------------------------------