%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : SET639+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 : n024.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:47:20 EDT 2022 % Result : Theorem 0.13s 0.35s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.12/0.12 % Problem : SET639+3 : 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 : n024.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 : Sat Jul 9 21:09:28 EDT 2022 % 0.13/0.34 % CPUTime : % 0.13/0.35 % SZS status Theorem % 0.13/0.35 % SZS output begin IncompleteProof % 0.13/0.35 cnf(c0, axiom, % 0.13/0.35 empty_set = intersection(sK5,sK4)). % 0.13/0.35 cnf(c1, plain, % 0.13/0.35 empty_set = intersection(sK5,sK4), % 0.13/0.35 inference(start, [], [c0])). % 0.13/0.35 % 0.13/0.35 cnf(c2, axiom, % 0.13/0.35 intersection(X0,X1) = intersection(X1,X0)). % 0.13/0.35 cnf(a0, assumption, % 0.13/0.35 intersection(X1,X0) = intersection(sK5,sK4)). % 0.13/0.35 cnf(a1, assumption, % 0.13/0.35 empty_set = X2). % 0.13/0.35 cnf(c3, plain, % 0.13/0.35 $false, % 0.13/0.35 inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])). % 0.13/0.35 cnf(c4, plain, % 0.13/0.35 $false, % 0.13/0.35 inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])). % 0.13/0.35 cnf(c5, plain, % 0.13/0.35 intersection(X0,X1) = X2, % 0.13/0.35 inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])). % 0.13/0.35 % 0.13/0.35 cnf(c6, axiom, % 0.13/0.35 intersection(X3,X4) = X3 | ~subset(X3,X4)). % 0.13/0.35 cnf(a2, assumption, % 0.13/0.35 intersection(X3,X4) = intersection(X0,X1)). % 0.13/0.35 cnf(c7, plain, % 0.13/0.35 $false, % 0.13/0.35 inference(strict_subterm_extension, [assumptions([a2])], [c5, c6])). % 0.13/0.35 cnf(c8, plain, % 0.13/0.35 ~subset(X3,X4), % 0.13/0.35 inference(strict_subterm_extension, [assumptions([a2])], [c5, c6])). % 0.13/0.35 cnf(c9, plain, % 0.13/0.35 X2 = X3, % 0.13/0.35 inference(strict_subterm_extension, [assumptions([a2])], [c5, c6])). % 0.13/0.35 % 0.13/0.35 cnf(c10, axiom, % 0.13/0.35 empty_set != sK4). % 0.13/0.35 cnf(a3, assumption, % 0.13/0.35 sK4 = X3). % 0.13/0.35 cnf(c11, plain, % 0.13/0.35 $false, % 0.13/0.35 inference(strict_subterm_extension, [assumptions([a3])], [c9, c10])). % 0.13/0.35 cnf(c12, plain, % 0.13/0.35 $false, % 0.13/0.35 inference(strict_subterm_extension, [assumptions([a3])], [c9, c10])). % 0.13/0.35 cnf(c13, plain, % 0.13/0.35 empty_set != X2, % 0.13/0.35 inference(strict_subterm_extension, [assumptions([a3])], [c9, c10])). % 0.13/0.35 % 0.13/0.35 cnf(a4, assumption, % 0.13/0.35 empty_set = X2). % 0.13/0.35 cnf(c14, plain, % 0.13/0.35 $false, % 0.13/0.35 inference(reflexivity, [assumptions([a4])], [c13])). % 0.13/0.35 % 0.13/0.35 cnf(c15, axiom, % 0.13/0.35 subset(sK4,sK5)). % 0.13/0.35 cnf(a5, assumption, % 0.13/0.35 X3 = sK4). % 0.13/0.35 cnf(a6, assumption, % 0.13/0.35 X4 = sK5). % 0.13/0.35 cnf(c16, plain, % 0.13/0.35 $false, % 0.13/0.35 inference(strict_predicate_extension, [assumptions([a5, a6])], [c8, c15])). % 0.13/0.35 cnf(c17, plain, % 0.13/0.35 $false, % 0.13/0.35 inference(strict_predicate_extension, [assumptions([a5, a6])], [c8, c15])). % 0.13/0.35 % 0.13/0.35 cnf(c18, plain, % 0.13/0.35 $false, % 0.13/0.35 inference(constraint_solving, [ % 0.13/0.35 bind(X0, sK4), % 0.13/0.35 bind(X1, sK5), % 0.13/0.35 bind(X2, empty_set), % 0.13/0.35 bind(X3, sK4), % 0.13/0.35 bind(X4, sK5) % 0.13/0.35 ], % 0.13/0.35 [a0, a1, a2, a3, a4, a5, a6])). % 0.13/0.35 % 0.13/0.35 % SZS output end IncompleteProof %------------------------------------------------------------------------------