%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : SET590+3 : 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 : n009.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:46:47 EDT 2022 % Result : Theorem 0.14s 0.35s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.13 % Problem : SET590+3 : TPTP v8.1.0. Released v2.2.0. % 0.07/0.14 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.14/0.35 % Computer : n009.cluster.edu % 0.14/0.35 % Model : x86_64 x86_64 % 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.35 % Memory : 8042.1875MB % 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.35 % CPULimit : 300 % 0.14/0.35 % WCLimit : 600 % 0.14/0.35 % DateTime : Sat Jul 9 23:07:07 EDT 2022 % 0.14/0.35 % CPUTime : % 0.14/0.35 % SZS status Theorem % 0.14/0.35 % SZS output begin IncompleteProof % 0.14/0.35 cnf(c0, axiom, % 0.14/0.35 ~subset(difference(sK1,sK2),sK1)). % 0.14/0.35 cnf(c1, plain, % 0.14/0.35 ~subset(difference(sK1,sK2),sK1), % 0.14/0.35 inference(start, [], [c0])). % 0.14/0.35 % 0.14/0.35 cnf(c2, axiom, % 0.14/0.35 subset(X0,X1) | ~member(sK0(X0,X1),X1)). % 0.14/0.35 cnf(a0, assumption, % 0.14/0.35 difference(sK1,sK2) = X0). % 0.14/0.35 cnf(a1, assumption, % 0.14/0.35 sK1 = X1). % 0.14/0.35 cnf(c3, plain, % 0.14/0.35 $false, % 0.14/0.35 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 0.14/0.35 cnf(c4, plain, % 0.14/0.35 ~member(sK0(X0,X1),X1), % 0.14/0.35 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 0.14/0.35 % 0.14/0.35 cnf(c5, axiom, % 0.14/0.35 member(X2,X3) | ~member(X2,difference(X3,X4))). % 0.14/0.35 cnf(a2, assumption, % 0.14/0.35 sK0(X0,X1) = X2). % 0.14/0.35 cnf(a3, assumption, % 0.14/0.35 X1 = X3). % 0.14/0.35 cnf(c6, plain, % 0.14/0.35 $false, % 0.14/0.35 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])). % 0.14/0.35 cnf(c7, plain, % 0.14/0.35 ~member(X2,difference(X3,X4)), % 0.14/0.35 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])). % 0.14/0.35 % 0.14/0.35 cnf(c8, axiom, % 0.14/0.35 subset(X5,X6) | member(sK0(X5,X6),X5)). % 0.14/0.35 cnf(a4, assumption, % 0.14/0.35 X2 = sK0(X5,X6)). % 0.14/0.35 cnf(a5, assumption, % 0.14/0.35 difference(X3,X4) = X5). % 0.14/0.35 cnf(c9, plain, % 0.14/0.35 $false, % 0.14/0.35 inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])). % 0.14/0.35 cnf(c10, plain, % 0.14/0.35 subset(X5,X6), % 0.14/0.35 inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])). % 0.14/0.35 % 0.14/0.35 cnf(c11, plain, % 0.14/0.35 ~subset(difference(sK1,sK2),sK1)). % 0.14/0.35 cnf(a6, assumption, % 0.14/0.35 X5 = difference(sK1,sK2)). % 0.14/0.35 cnf(a7, assumption, % 0.14/0.35 X6 = sK1). % 0.14/0.35 cnf(c12, plain, % 0.14/0.35 $false, % 0.14/0.35 inference(predicate_reduction, [assumptions([a6, a7])], [c10, c11])). % 0.14/0.35 % 0.14/0.35 cnf(c13, plain, % 0.14/0.35 $false, % 0.14/0.35 inference(constraint_solving, [ % 0.14/0.35 bind(X0, difference(sK1,sK2)), % 0.14/0.35 bind(X1, sK1), % 0.14/0.35 bind(X2, sK0(X0,X1)), % 0.14/0.35 bind(X3, sK1), % 0.14/0.35 bind(X4, sK2), % 0.14/0.35 bind(X5, difference(sK1,sK2)), % 0.14/0.35 bind(X6, sK1) % 0.14/0.35 ], % 0.14/0.35 [a0, a1, a2, a3, a4, a5, a6, a7])). % 0.14/0.35 % 0.14/0.35 % SZS output end IncompleteProof %------------------------------------------------------------------------------