%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : SET008-1 : TPTP v8.1.0. Released v1.0.0. % Transfm : none % Format : tptp:raw % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % Computer : n011.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:12 EDT 2022 % Result : Unsatisfiable 0.12s 0.35s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.11 % Problem : SET008-1 : TPTP v8.1.0. Released v1.0.0. % 0.11/0.12 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.12/0.33 % Computer : n011.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 20:17:26 EDT 2022 % 0.12/0.33 % CPUTime : % 0.12/0.35 % SZS status Unsatisfiable % 0.12/0.35 % SZS output begin IncompleteProof % 0.12/0.35 cnf(c0, axiom, % 0.12/0.35 ~intersection(a,bDa,aI_bDa)). % 0.12/0.35 cnf(c1, plain, % 0.12/0.35 ~intersection(a,bDa,aI_bDa), % 0.12/0.35 inference(start, [], [c0])). % 0.12/0.35 % 0.12/0.35 cnf(c2, axiom, % 0.12/0.35 member(h(X0,X1,X2),X1) | intersection(X0,X1,X2) | member(h(X0,X1,X2),X2)). % 0.12/0.35 cnf(a0, assumption, % 0.12/0.35 a = X0). % 0.12/0.35 cnf(a1, assumption, % 0.12/0.35 bDa = X1). % 0.12/0.35 cnf(a2, assumption, % 0.12/0.35 aI_bDa = X2). % 0.12/0.35 cnf(c3, plain, % 0.12/0.35 $false, % 0.12/0.35 inference(strict_predicate_extension, [assumptions([a0, a1, a2])], [c1, c2])). % 0.12/0.35 cnf(c4, plain, % 0.12/0.35 member(h(X0,X1,X2),X1) | member(h(X0,X1,X2),X2), % 0.12/0.35 inference(strict_predicate_extension, [assumptions([a0, a1, a2])], [c1, c2])). % 0.12/0.35 % 0.12/0.35 cnf(c5, axiom, % 0.12/0.35 ~difference(X3,X4,X5) | ~member(X6,X5) | ~member(X6,X4)). % 0.12/0.35 cnf(a3, assumption, % 0.12/0.35 h(X0,X1,X2) = X6). % 0.12/0.35 cnf(a4, assumption, % 0.12/0.35 X1 = X5). % 0.12/0.35 cnf(c6, plain, % 0.12/0.35 member(h(X0,X1,X2),X2), % 0.12/0.35 inference(strict_predicate_extension, [assumptions([a3, a4])], [c4, c5])). % 0.12/0.35 cnf(c7, plain, % 0.12/0.35 ~difference(X3,X4,X5) | ~member(X6,X4), % 0.12/0.35 inference(strict_predicate_extension, [assumptions([a3, a4])], [c4, c5])). % 0.12/0.35 % 0.12/0.35 cnf(c8, axiom, % 0.12/0.35 difference(b,a,bDa)). % 0.12/0.35 cnf(a5, assumption, % 0.12/0.35 X3 = b). % 0.12/0.35 cnf(a6, assumption, % 0.12/0.35 X4 = a). % 0.12/0.35 cnf(a7, assumption, % 0.12/0.35 X5 = bDa). % 0.12/0.35 cnf(c9, plain, % 0.12/0.35 ~member(X6,X4), % 0.12/0.35 inference(strict_predicate_extension, [assumptions([a5, a6, a7])], [c7, c8])). % 0.12/0.35 cnf(c10, plain, % 0.12/0.35 $false, % 0.12/0.35 inference(strict_predicate_extension, [assumptions([a5, a6, a7])], [c7, c8])). % 0.12/0.35 % 0.12/0.35 cnf(c11, axiom, % 0.12/0.35 member(h(X7,X8,X9),X7) | intersection(X7,X8,X9) | member(h(X7,X8,X9),X9)). % 0.12/0.35 cnf(a8, assumption, % 0.12/0.35 X6 = h(X7,X8,X9)). % 0.12/0.35 cnf(a9, assumption, % 0.12/0.35 X4 = X7). % 0.12/0.35 cnf(c12, plain, % 0.12/0.35 $false, % 0.12/0.35 inference(strict_predicate_extension, [assumptions([a8, a9])], [c9, c11])). % 0.12/0.35 cnf(c13, plain, % 0.12/0.35 intersection(X7,X8,X9) | member(h(X7,X8,X9),X9), % 0.12/0.35 inference(strict_predicate_extension, [assumptions([a8, a9])], [c9, c11])). % 0.12/0.35 % 0.12/0.35 cnf(c14, plain, % 0.12/0.35 ~intersection(a,bDa,aI_bDa)). % 0.12/0.35 cnf(a10, assumption, % 0.12/0.35 X7 = a). % 0.12/0.35 cnf(a11, assumption, % 0.12/0.35 X8 = bDa). % 0.12/0.35 cnf(a12, assumption, % 0.12/0.35 X9 = aI_bDa). % 0.12/0.35 cnf(c15, plain, % 0.12/0.35 member(h(X7,X8,X9),X9), % 0.12/0.35 inference(predicate_reduction, [assumptions([a10, a11, a12])], [c13, c14])). % 0.12/0.35 % 0.12/0.35 cnf(c16, axiom, % 0.12/0.35 ~member(X10,aI_bDa)). % 0.12/0.35 cnf(a13, assumption, % 0.12/0.35 h(X7,X8,X9) = X10). % 0.12/0.35 cnf(a14, assumption, % 0.12/0.35 X9 = aI_bDa). % 0.12/0.35 cnf(c17, plain, % 0.12/0.35 $false, % 0.12/0.35 inference(strict_predicate_extension, [assumptions([a13, a14])], [c15, c16])). % 0.12/0.35 cnf(c18, plain, % 0.12/0.35 $false, % 0.12/0.35 inference(strict_predicate_extension, [assumptions([a13, a14])], [c15, c16])). % 0.12/0.35 % 0.12/0.35 cnf(c19, plain, % 0.12/0.35 ~member(h(X7,X8,X9),X9)). % 0.12/0.35 cnf(a15, assumption, % 0.12/0.35 h(X0,X1,X2) = h(X7,X8,X9)). % 0.12/0.35 cnf(a16, assumption, % 0.12/0.35 X2 = X9). % 0.12/0.35 cnf(c20, plain, % 0.12/0.35 $false, % 0.12/0.35 inference(predicate_reduction, [assumptions([a15, a16])], [c6, c19])). % 0.12/0.35 % 0.12/0.35 cnf(c21, plain, % 0.12/0.35 $false, % 0.12/0.35 inference(constraint_solving, [ % 0.12/0.35 bind(X0, a), % 0.12/0.35 bind(X1, bDa), % 0.12/0.35 bind(X2, aI_bDa), % 0.12/0.35 bind(X3, b), % 0.12/0.35 bind(X4, a), % 0.12/0.35 bind(X5, bDa), % 0.12/0.35 bind(X6, h(X0,X1,X2)), % 0.12/0.35 bind(X7, a), % 0.12/0.35 bind(X8, bDa), % 0.12/0.35 bind(X9, aI_bDa), % 0.12/0.35 bind(X10, h(X7,X8,X9)) % 0.12/0.35 ], % 0.12/0.35 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16])). % 0.12/0.35 % 0.12/0.35 % SZS output end IncompleteProof %------------------------------------------------------------------------------