%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : SET046+1 : TPTP v8.1.0. Released v2.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 : n015.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:58 EDT 2022 % Result : Theorem 0.13s 0.34s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.04/0.12 % Problem : SET046+1 : TPTP v8.1.0. Released v2.0.0. % 0.04/0.12 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.13/0.33 % Computer : n015.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 18:34:07 EDT 2022 % 0.13/0.33 % CPUTime : % 0.13/0.34 % SZS status Theorem % 0.13/0.34 % SZS output begin IncompleteProof % 0.13/0.34 cnf(c0, axiom, % 0.13/0.34 ~element(X0,X1) | ~element(X1,X0) | ~element(X1,sK0)). % 0.13/0.34 cnf(c1, plain, % 0.13/0.34 ~element(X0,X1) | ~element(X1,X0) | ~element(X1,sK0), % 0.13/0.34 inference(start, [], [c0])). % 0.13/0.34 % 0.13/0.34 cnf(c2, axiom, % 0.13/0.34 element(X2,sK0) | element(X2,sK1(X2))). % 0.13/0.34 cnf(a0, assumption, % 0.13/0.34 X0 = X2). % 0.13/0.34 cnf(a1, assumption, % 0.13/0.34 X1 = sK1(X2)). % 0.13/0.34 cnf(c3, plain, % 0.13/0.34 ~element(X1,X0) | ~element(X1,sK0), % 0.13/0.34 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 0.13/0.34 cnf(c4, plain, % 0.13/0.34 element(X2,sK0), % 0.13/0.34 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 0.13/0.34 % 0.13/0.34 cnf(c5, axiom, % 0.13/0.34 ~element(X3,X4) | ~element(X4,X3) | ~element(X4,sK0)). % 0.13/0.34 cnf(a2, assumption, % 0.13/0.34 X2 = X4). % 0.13/0.34 cnf(a3, assumption, % 0.13/0.34 sK0 = sK0). % 0.13/0.34 cnf(c6, plain, % 0.13/0.34 $false, % 0.13/0.34 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])). % 0.13/0.34 cnf(c7, plain, % 0.13/0.34 ~element(X3,X4) | ~element(X4,X3), % 0.13/0.34 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])). % 0.13/0.34 % 0.13/0.34 cnf(c8, plain, % 0.13/0.34 element(X2,sK0)). % 0.13/0.34 cnf(a4, assumption, % 0.13/0.34 X3 = X2). % 0.13/0.34 cnf(a5, assumption, % 0.13/0.34 X4 = sK0). % 0.13/0.34 cnf(c9, plain, % 0.13/0.34 ~element(X4,X3), % 0.13/0.34 inference(predicate_reduction, [assumptions([a4, a5])], [c7, c8])). % 0.13/0.34 % 0.13/0.34 cnf(c10, plain, % 0.13/0.34 element(X2,sK0)). % 0.13/0.34 cnf(a6, assumption, % 0.13/0.34 X4 = X2). % 0.13/0.34 cnf(a7, assumption, % 0.13/0.34 X3 = sK0). % 0.13/0.34 cnf(c11, plain, % 0.13/0.34 $false, % 0.13/0.34 inference(predicate_reduction, [assumptions([a6, a7])], [c9, c10])). % 0.13/0.34 % 0.13/0.34 cnf(c12, axiom, % 0.13/0.34 element(X5,sK0) | element(sK1(X5),X5)). % 0.13/0.34 cnf(a8, assumption, % 0.13/0.34 X1 = sK1(X5)). % 0.13/0.34 cnf(a9, assumption, % 0.13/0.34 X0 = X5). % 0.13/0.34 cnf(c13, plain, % 0.13/0.34 ~element(X1,sK0), % 0.13/0.34 inference(strict_predicate_extension, [assumptions([a8, a9])], [c3, c12])). % 0.13/0.34 cnf(c14, plain, % 0.13/0.34 element(X5,sK0), % 0.13/0.34 inference(strict_predicate_extension, [assumptions([a8, a9])], [c3, c12])). % 0.13/0.34 % 0.13/0.34 cnf(c15, plain, % 0.13/0.34 ~element(X2,sK0)). % 0.13/0.34 cnf(a10, assumption, % 0.13/0.34 X5 = X2). % 0.13/0.34 cnf(a11, assumption, % 0.13/0.34 sK0 = sK0). % 0.13/0.34 cnf(c16, plain, % 0.13/0.34 $false, % 0.13/0.34 inference(predicate_reduction, [assumptions([a10, a11])], [c14, c15])). % 0.13/0.34 % 0.13/0.34 cnf(c17, plain, % 0.13/0.34 element(X1,X0)). % 0.13/0.34 cnf(a12, assumption, % 0.13/0.34 X1 = X1). % 0.13/0.34 cnf(a13, assumption, % 0.13/0.34 sK0 = X0). % 0.13/0.34 cnf(c18, plain, % 0.13/0.34 $false, % 0.13/0.34 inference(predicate_reduction, [assumptions([a12, a13])], [c13, c17])). % 0.13/0.34 % 0.13/0.34 cnf(c19, plain, % 0.13/0.34 $false, % 0.13/0.34 inference(constraint_solving, [ % 0.13/0.34 bind(X0, sK0), % 0.13/0.34 bind(X1, sK1(X2)), % 0.13/0.34 bind(X2, sK0), % 0.13/0.34 bind(X3, sK0), % 0.13/0.34 bind(X4, sK0), % 0.13/0.34 bind(X5, sK0) % 0.13/0.34 ], % 0.13/0.34 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13])). % 0.13/0.34 % 0.13/0.34 % SZS output end IncompleteProof %------------------------------------------------------------------------------