%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : SET766+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 : 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:00 EDT 2022 % Result : Theorem 3.30s 0.85s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.12/0.12 % Problem : SET766+4 : TPTP v8.1.0. Released v2.2.0. % 0.12/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.13/0.34 % Computer : n010.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 : Sun Jul 10 07:50:15 EDT 2022 % 0.19/0.34 % CPUTime : % 3.30/0.85 % SZS status Theorem % 3.30/0.85 % SZS output begin IncompleteProof % 3.30/0.85 cnf(c0, axiom, % 3.30/0.85 ~member(sK30,equivalence_class(sK30,sK28,sK29))). % 3.30/0.85 cnf(c1, plain, % 3.30/0.85 ~member(sK30,equivalence_class(sK30,sK28,sK29)), % 3.30/0.85 inference(start, [], [c0])). % 3.30/0.85 % 3.30/0.85 cnf(c2, axiom, % 3.30/0.85 member(X0,equivalence_class(X1,X2,X3)) | ~apply(X3,X1,X0) | ~member(X0,X2)). % 3.30/0.85 cnf(a0, assumption, % 3.30/0.85 sK30 = X0). % 3.30/0.85 cnf(a1, assumption, % 3.30/0.85 equivalence_class(sK30,sK28,sK29) = equivalence_class(X1,X2,X3)). % 3.30/0.85 cnf(c3, plain, % 3.30/0.85 $false, % 3.30/0.85 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 3.30/0.85 cnf(c4, plain, % 3.30/0.85 ~apply(X3,X1,X0) | ~member(X0,X2), % 3.30/0.85 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 3.30/0.85 % 3.30/0.85 cnf(c5, axiom, % 3.30/0.85 apply(X4,X5,X5) | ~member(X5,X6) | ~sP5(X6,X4)). % 3.30/0.85 cnf(a2, assumption, % 3.30/0.85 X3 = X4). % 3.30/0.85 cnf(a3, assumption, % 3.30/0.85 X1 = X5). % 3.30/0.85 cnf(a4, assumption, % 3.30/0.85 X0 = X5). % 3.30/0.85 cnf(c6, plain, % 3.30/0.85 ~member(X0,X2), % 3.30/0.85 inference(strict_predicate_extension, [assumptions([a2, a3, a4])], [c4, c5])). % 3.30/0.85 cnf(c7, plain, % 3.30/0.85 ~member(X5,X6) | ~sP5(X6,X4), % 3.30/0.85 inference(strict_predicate_extension, [assumptions([a2, a3, a4])], [c4, c5])). % 3.30/0.85 % 3.30/0.85 cnf(c8, axiom, % 3.30/0.85 member(sK30,sK28)). % 3.30/0.85 cnf(a5, assumption, % 3.30/0.85 X5 = sK30). % 3.30/0.85 cnf(a6, assumption, % 3.30/0.85 X6 = sK28). % 3.30/0.85 cnf(c9, plain, % 3.30/0.85 ~sP5(X6,X4), % 3.30/0.85 inference(strict_predicate_extension, [assumptions([a5, a6])], [c7, c8])). % 3.30/0.85 cnf(c10, plain, % 3.30/0.85 $false, % 3.30/0.85 inference(strict_predicate_extension, [assumptions([a5, a6])], [c7, c8])). % 3.30/0.85 % 3.30/0.85 cnf(c11, axiom, % 3.30/0.85 sP5(X7,X8) | ~equivalence(X8,X7)). % 3.30/0.85 cnf(a7, assumption, % 3.30/0.85 X6 = X7). % 3.30/0.85 cnf(a8, assumption, % 3.30/0.85 X4 = X8). % 3.30/0.85 cnf(c12, plain, % 3.30/0.85 $false, % 3.30/0.85 inference(strict_predicate_extension, [assumptions([a7, a8])], [c9, c11])). % 3.30/0.85 cnf(c13, plain, % 3.30/0.85 ~equivalence(X8,X7), % 3.30/0.85 inference(strict_predicate_extension, [assumptions([a7, a8])], [c9, c11])). % 3.30/0.85 % 3.30/0.85 cnf(c14, axiom, % 3.30/0.85 equivalence(sK29,sK28)). % 3.30/0.85 cnf(a9, assumption, % 3.30/0.85 X8 = sK29). % 3.30/0.85 cnf(a10, assumption, % 3.30/0.85 X7 = sK28). % 3.30/0.85 cnf(c15, plain, % 3.30/0.85 $false, % 3.30/0.85 inference(strict_predicate_extension, [assumptions([a9, a10])], [c13, c14])). % 3.30/0.85 cnf(c16, plain, % 3.30/0.85 $false, % 3.30/0.85 inference(strict_predicate_extension, [assumptions([a9, a10])], [c13, c14])). % 3.30/0.85 % 3.30/0.85 cnf(c17, plain, % 3.30/0.85 member(X5,X6)). % 3.30/0.85 cnf(a11, assumption, % 3.30/0.85 X0 = X5). % 3.30/0.85 cnf(a12, assumption, % 3.30/0.85 X2 = X6). % 3.30/0.85 cnf(c18, plain, % 3.30/0.85 $false, % 3.30/0.85 inference(predicate_reduction, [assumptions([a11, a12])], [c6, c17])). % 3.30/0.85 % 3.30/0.85 cnf(c19, plain, % 3.30/0.85 $false, % 3.30/0.85 inference(constraint_solving, [ % 3.30/0.85 bind(X0, sK30), % 3.30/0.85 bind(X1, sK30), % 3.30/0.85 bind(X2, sK28), % 3.30/0.85 bind(X3, sK29), % 3.30/0.85 bind(X4, sK29), % 3.30/0.85 bind(X5, sK30), % 3.30/0.85 bind(X6, sK28), % 3.30/0.85 bind(X7, sK28), % 3.30/0.85 bind(X8, sK29) % 3.30/0.85 ], % 3.30/0.85 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12])). % 3.30/0.85 % 3.30/0.85 % SZS output end IncompleteProof %------------------------------------------------------------------------------