%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : SET797+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 : n014.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 5.32s 1.08s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : SET797+4 : TPTP v8.1.0. Released v3.2.0. % 0.07/0.12 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.13/0.33 % Computer : n014.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 : Sat Jul 9 23:05:50 EDT 2022 % 0.13/0.34 % CPUTime : % 5.32/1.08 % SZS status Theorem % 5.32/1.08 % SZS output begin IncompleteProof % 5.32/1.08 cnf(c0, axiom, % 5.32/1.08 upper_bound(sK33,sK29,sK32)). % 5.32/1.08 cnf(c1, plain, % 5.32/1.08 upper_bound(sK33,sK29,sK32), % 5.32/1.08 inference(start, [], [c0])). % 5.32/1.08 % 5.32/1.08 cnf(c2, axiom, % 5.32/1.08 apply(X0,X1,X2) | ~member(X1,X3) | ~upper_bound(X2,X0,X3)). % 5.32/1.08 cnf(a0, assumption, % 5.32/1.08 sK33 = X2). % 5.32/1.08 cnf(a1, assumption, % 5.32/1.08 sK29 = X0). % 5.32/1.08 cnf(a2, assumption, % 5.32/1.08 sK32 = X3). % 5.32/1.08 cnf(c3, plain, % 5.32/1.08 $false, % 5.32/1.08 inference(strict_predicate_extension, [assumptions([a0, a1, a2])], [c1, c2])). % 5.32/1.08 cnf(c4, plain, % 5.32/1.08 apply(X0,X1,X2) | ~member(X1,X3), % 5.32/1.08 inference(strict_predicate_extension, [assumptions([a0, a1, a2])], [c1, c2])). % 5.32/1.08 % 5.32/1.08 cnf(c5, axiom, % 5.32/1.08 upper_bound(X4,X5,X6) | ~apply(X5,sK21(X5,X6,X4),X4)). % 5.32/1.08 cnf(a3, assumption, % 5.32/1.08 X0 = X5). % 5.32/1.08 cnf(a4, assumption, % 5.32/1.08 X1 = sK21(X5,X6,X4)). % 5.32/1.08 cnf(a5, assumption, % 5.32/1.08 X2 = X4). % 5.32/1.08 cnf(c6, plain, % 5.32/1.08 ~member(X1,X3), % 5.32/1.08 inference(strict_predicate_extension, [assumptions([a3, a4, a5])], [c4, c5])). % 5.32/1.08 cnf(c7, plain, % 5.32/1.08 upper_bound(X4,X5,X6), % 5.32/1.08 inference(strict_predicate_extension, [assumptions([a3, a4, a5])], [c4, c5])). % 5.32/1.08 % 5.32/1.08 cnf(c8, axiom, % 5.32/1.08 ~upper_bound(sK33,sK29,sK31)). % 5.32/1.08 cnf(a6, assumption, % 5.32/1.08 X4 = sK33). % 5.32/1.08 cnf(a7, assumption, % 5.32/1.08 X5 = sK29). % 5.32/1.08 cnf(a8, assumption, % 5.32/1.08 X6 = sK31). % 5.32/1.08 cnf(c9, plain, % 5.32/1.08 $false, % 5.32/1.08 inference(strict_predicate_extension, [assumptions([a6, a7, a8])], [c7, c8])). % 5.32/1.08 cnf(c10, plain, % 5.32/1.08 $false, % 5.32/1.08 inference(strict_predicate_extension, [assumptions([a6, a7, a8])], [c7, c8])). % 5.32/1.08 % 5.32/1.08 cnf(c11, axiom, % 5.32/1.08 member(X7,X8) | ~member(X7,X9) | ~subset(X9,X8)). % 5.32/1.08 cnf(a9, assumption, % 5.32/1.08 X1 = X7). % 5.32/1.08 cnf(a10, assumption, % 5.32/1.08 X3 = X8). % 5.32/1.08 cnf(c12, plain, % 5.32/1.08 $false, % 5.32/1.08 inference(strict_predicate_extension, [assumptions([a9, a10])], [c6, c11])). % 5.32/1.08 cnf(c13, plain, % 5.32/1.08 ~member(X7,X9) | ~subset(X9,X8), % 5.32/1.08 inference(strict_predicate_extension, [assumptions([a9, a10])], [c6, c11])). % 5.32/1.08 % 5.32/1.08 cnf(c14, axiom, % 5.32/1.08 upper_bound(X10,X11,X12) | member(sK21(X11,X12,X10),X12)). % 5.32/1.08 cnf(a11, assumption, % 5.32/1.08 X7 = sK21(X11,X12,X10)). % 5.32/1.08 cnf(a12, assumption, % 5.32/1.08 X9 = X12). % 5.32/1.08 cnf(c15, plain, % 5.32/1.08 ~subset(X9,X8), % 5.32/1.08 inference(strict_predicate_extension, [assumptions([a11, a12])], [c13, c14])). % 5.32/1.08 cnf(c16, plain, % 5.32/1.08 upper_bound(X10,X11,X12), % 5.32/1.08 inference(strict_predicate_extension, [assumptions([a11, a12])], [c13, c14])). % 5.32/1.08 % 5.32/1.08 cnf(c17, plain, % 5.32/1.08 ~upper_bound(X4,X5,X6)). % 5.32/1.08 cnf(a13, assumption, % 5.32/1.08 X10 = X4). % 5.32/1.08 cnf(a14, assumption, % 5.32/1.08 X11 = X5). % 5.32/1.08 cnf(a15, assumption, % 5.32/1.08 X12 = X6). % 5.32/1.08 cnf(c18, plain, % 5.32/1.08 $false, % 5.32/1.08 inference(predicate_reduction, [assumptions([a13, a14, a15])], [c16, c17])). % 5.32/1.08 % 5.32/1.08 cnf(c19, axiom, % 5.32/1.08 subset(sK31,sK32)). % 5.32/1.08 cnf(a16, assumption, % 5.32/1.08 X9 = sK31). % 5.32/1.08 cnf(a17, assumption, % 5.32/1.08 X8 = sK32). % 5.32/1.08 cnf(c20, plain, % 5.32/1.08 $false, % 5.32/1.08 inference(strict_predicate_extension, [assumptions([a16, a17])], [c15, c19])). % 5.32/1.08 cnf(c21, plain, % 5.32/1.08 $false, % 5.32/1.08 inference(strict_predicate_extension, [assumptions([a16, a17])], [c15, c19])). % 5.32/1.08 % 5.32/1.08 cnf(c22, plain, % 5.32/1.08 $false, % 5.32/1.08 inference(constraint_solving, [ % 5.32/1.08 bind(X0, sK29), % 5.32/1.08 bind(X1, sK21(X5,X6,X4)), % 5.32/1.08 bind(X2, sK33), % 5.32/1.08 bind(X3, sK32), % 5.32/1.08 bind(X4, sK33), % 5.32/1.08 bind(X5, sK29), % 5.32/1.08 bind(X6, sK31), % 5.32/1.08 bind(X7, sK21(X5,X6,X4)), % 5.32/1.08 bind(X8, sK32), % 5.32/1.08 bind(X9, sK31), % 5.32/1.08 bind(X10, sK33), % 5.32/1.08 bind(X11, sK29), % 5.32/1.08 bind(X12, sK31) % 5.32/1.08 ], % 5.32/1.08 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17])). % 5.32/1.08 % 5.32/1.08 % SZS output end IncompleteProof %------------------------------------------------------------------------------