%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : SET093+1 : TPTP v8.1.0. Bugfixed v7.3.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:43:40 EDT 2022 % Result : Theorem 0.13s 0.36s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : SET093+1 : TPTP v8.1.0. Bugfixed v7.3.0. % 0.07/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.13/0.34 % Computer : n009.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 01:19:22 EDT 2022 % 0.13/0.35 % CPUTime : % 0.13/0.36 % SZS status Theorem % 0.13/0.36 % SZS output begin IncompleteProof % 0.13/0.36 cnf(c0, axiom, % 0.13/0.36 sK9 = unordered_pair(member_of(sK9),member_of(sK9))). % 0.13/0.36 cnf(c1, plain, % 0.13/0.36 sK9 = unordered_pair(member_of(sK9),member_of(sK9)), % 0.13/0.36 inference(start, [], [c0])). % 0.13/0.36 % 0.13/0.36 cnf(c2, axiom, % 0.13/0.36 member(unordered_pair(X0,X1),universal_class)). % 0.13/0.36 cnf(a0, assumption, % 0.13/0.36 unordered_pair(X0,X1) = unordered_pair(member_of(sK9),member_of(sK9))). % 0.13/0.36 cnf(a1, assumption, % 0.13/0.36 sK9 = X2). % 0.13/0.36 cnf(c3, plain, % 0.13/0.36 $false, % 0.13/0.36 inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])). % 0.13/0.36 cnf(c4, plain, % 0.13/0.36 $false, % 0.13/0.36 inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])). % 0.13/0.36 cnf(c5, plain, % 0.13/0.36 member(X2,universal_class), % 0.13/0.36 inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])). % 0.13/0.36 % 0.13/0.36 cnf(c6, axiom, % 0.13/0.36 ~member(sK9,universal_class)). % 0.13/0.36 cnf(a2, assumption, % 0.13/0.36 X2 = sK9). % 0.13/0.36 cnf(a3, assumption, % 0.13/0.36 universal_class = universal_class). % 0.13/0.36 cnf(c7, plain, % 0.13/0.36 $false, % 0.13/0.36 inference(strict_predicate_extension, [assumptions([a2, a3])], [c5, c6])). % 0.13/0.36 cnf(c8, plain, % 0.13/0.36 $false, % 0.13/0.36 inference(strict_predicate_extension, [assumptions([a2, a3])], [c5, c6])). % 0.13/0.36 % 0.13/0.36 cnf(c9, plain, % 0.13/0.36 $false, % 0.13/0.36 inference(constraint_solving, [ % 0.13/0.36 bind(X0, member_of(sK9)), % 0.13/0.36 bind(X1, member_of(sK9)), % 0.13/0.36 bind(X2, sK9) % 0.13/0.36 ], % 0.13/0.36 [a0, a1, a2, a3])). % 0.13/0.36 % 0.13/0.36 % SZS output end IncompleteProof %------------------------------------------------------------------------------