%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : SET798+4 : 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 : n010.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:48:11 EDT 2022 % Result : Theorem 2.13s 0.71s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : SET798+4 : TPTP v8.1.0. Released v3.2.0. % 0.12/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.12/0.34 % Computer : n010.cluster.edu % 0.12/0.34 % Model : x86_64 x86_64 % 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.34 % Memory : 8042.1875MB % 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.34 % CPULimit : 300 % 0.12/0.34 % WCLimit : 600 % 0.12/0.34 % DateTime : Mon Jul 11 02:03:00 EDT 2022 % 0.12/0.34 % CPUTime : % 2.13/0.71 % SZS status Theorem % 2.13/0.71 % SZS output begin IncompleteProof % 2.13/0.71 cnf(c0, axiom, % 2.13/0.71 subset(sK31,sK32)). % 2.13/0.71 cnf(c1, plain, % 2.13/0.71 subset(sK31,sK32), % 2.13/0.71 inference(start, [], [c0])). % 2.13/0.71 % 2.13/0.71 cnf(c2, axiom, % 2.13/0.71 member(X0,X1) | ~member(X0,X2) | ~subset(X2,X1)). % 2.13/0.71 cnf(a0, assumption, % 2.13/0.71 sK31 = X2). % 2.13/0.71 cnf(a1, assumption, % 2.13/0.71 sK32 = X1). % 2.13/0.71 cnf(c3, plain, % 2.13/0.71 $false, % 2.13/0.71 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 2.13/0.71 cnf(c4, plain, % 2.13/0.71 member(X0,X1) | ~member(X0,X2), % 2.13/0.71 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 2.13/0.71 % 2.13/0.71 cnf(c5, axiom, % 2.13/0.71 apply(X3,X4,X5) | ~member(X5,X6) | ~lower_bound(X4,X3,X6)). % 2.13/0.71 cnf(a2, assumption, % 2.13/0.71 X0 = X5). % 2.13/0.71 cnf(a3, assumption, % 2.13/0.71 X1 = X6). % 2.13/0.71 cnf(c6, plain, % 2.13/0.71 ~member(X0,X2), % 2.13/0.71 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])). % 2.13/0.71 cnf(c7, plain, % 2.13/0.71 apply(X3,X4,X5) | ~lower_bound(X4,X3,X6), % 2.13/0.71 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])). % 2.13/0.71 % 2.13/0.71 cnf(c8, axiom, % 2.13/0.71 lower_bound(X7,X8,X9) | ~apply(X8,X7,sK22(X8,X9,X7))). % 2.13/0.71 cnf(a4, assumption, % 2.13/0.71 X3 = X8). % 2.13/0.71 cnf(a5, assumption, % 2.13/0.71 X4 = X7). % 2.13/0.71 cnf(a6, assumption, % 2.13/0.71 X5 = sK22(X8,X9,X7)). % 2.13/0.71 cnf(c9, plain, % 2.13/0.71 ~lower_bound(X4,X3,X6), % 2.13/0.71 inference(strict_predicate_extension, [assumptions([a4, a5, a6])], [c7, c8])). % 2.13/0.71 cnf(c10, plain, % 2.13/0.71 lower_bound(X7,X8,X9), % 2.13/0.71 inference(strict_predicate_extension, [assumptions([a4, a5, a6])], [c7, c8])). % 2.13/0.71 % 2.13/0.71 cnf(c11, axiom, % 2.13/0.71 ~lower_bound(sK33,sK29,sK31)). % 2.13/0.71 cnf(a7, assumption, % 2.13/0.71 X7 = sK33). % 2.13/0.71 cnf(a8, assumption, % 2.13/0.71 X8 = sK29). % 2.13/0.71 cnf(a9, assumption, % 2.13/0.71 X9 = sK31). % 2.13/0.71 cnf(c12, plain, % 2.13/0.71 $false, % 2.13/0.71 inference(strict_predicate_extension, [assumptions([a7, a8, a9])], [c10, c11])). % 2.13/0.71 cnf(c13, plain, % 2.13/0.71 $false, % 2.13/0.71 inference(strict_predicate_extension, [assumptions([a7, a8, a9])], [c10, c11])). % 2.13/0.71 % 2.13/0.71 cnf(c14, axiom, % 2.13/0.71 lower_bound(sK33,sK29,sK32)). % 2.13/0.71 cnf(a10, assumption, % 2.13/0.71 X4 = sK33). % 2.13/0.71 cnf(a11, assumption, % 2.13/0.71 X3 = sK29). % 2.13/0.71 cnf(a12, assumption, % 2.13/0.71 X6 = sK32). % 2.13/0.71 cnf(c15, plain, % 2.13/0.71 $false, % 2.13/0.71 inference(strict_predicate_extension, [assumptions([a10, a11, a12])], [c9, c14])). % 2.13/0.71 cnf(c16, plain, % 2.13/0.71 $false, % 2.13/0.71 inference(strict_predicate_extension, [assumptions([a10, a11, a12])], [c9, c14])). % 2.13/0.71 % 2.13/0.71 cnf(c17, axiom, % 2.13/0.71 lower_bound(X10,X11,X12) | member(sK22(X11,X12,X10),X12)). % 2.13/0.71 cnf(a13, assumption, % 2.13/0.71 X0 = sK22(X11,X12,X10)). % 2.13/0.71 cnf(a14, assumption, % 2.13/0.71 X2 = X12). % 2.13/0.71 cnf(c18, plain, % 2.13/0.71 $false, % 2.13/0.71 inference(strict_predicate_extension, [assumptions([a13, a14])], [c6, c17])). % 2.13/0.71 cnf(c19, plain, % 2.13/0.71 lower_bound(X10,X11,X12), % 2.13/0.71 inference(strict_predicate_extension, [assumptions([a13, a14])], [c6, c17])). % 2.13/0.71 % 2.13/0.71 cnf(c20, plain, % 2.13/0.71 ~lower_bound(X7,X8,X9)). % 2.13/0.71 cnf(a15, assumption, % 2.13/0.71 X10 = X7). % 2.13/0.71 cnf(a16, assumption, % 2.13/0.71 X11 = X8). % 2.13/0.71 cnf(a17, assumption, % 2.13/0.71 X12 = X9). % 2.13/0.71 cnf(c21, plain, % 2.13/0.71 $false, % 2.13/0.71 inference(predicate_reduction, [assumptions([a15, a16, a17])], [c19, c20])). % 2.13/0.71 % 2.13/0.71 cnf(c22, plain, % 2.13/0.71 $false, % 2.13/0.71 inference(constraint_solving, [ % 2.13/0.71 bind(X0, sK22(X8,X9,X7)), % 2.13/0.71 bind(X1, sK32), % 2.13/0.71 bind(X2, sK31), % 2.13/0.71 bind(X3, sK29), % 2.13/0.71 bind(X4, sK33), % 2.13/0.71 bind(X5, sK22(X8,X9,X7)), % 2.13/0.71 bind(X6, sK32), % 2.13/0.71 bind(X7, sK33), % 2.13/0.71 bind(X8, sK29), % 2.13/0.71 bind(X9, sK31), % 2.13/0.71 bind(X10, sK33), % 2.13/0.71 bind(X11, sK29), % 2.13/0.71 bind(X12, sK31) % 2.13/0.71 ], % 2.13/0.71 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17])). % 2.13/0.71 % 2.13/0.71 % SZS output end IncompleteProof %------------------------------------------------------------------------------