%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : SEU295+1 : TPTP v8.1.0. Released v3.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 : n032.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 11:54:49 EDT 2022 % Result : Theorem 0.10s 0.30s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.02/0.10 % Problem : SEU295+1 : TPTP v8.1.0. Released v3.3.0. % 0.02/0.10 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.10/0.29 % Computer : n032.cluster.edu % 0.10/0.29 % Model : x86_64 x86_64 % 0.10/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.10/0.29 % Memory : 8042.1875MB % 0.10/0.29 % OS : Linux 3.10.0-693.el7.x86_64 % 0.10/0.29 % CPULimit : 300 % 0.10/0.29 % WCLimit : 600 % 0.10/0.29 % DateTime : Mon Jun 20 06:33:18 EDT 2022 % 0.10/0.29 % CPUTime : % 0.10/0.30 % SZS status Theorem % 0.10/0.30 % SZS output begin IncompleteProof % 0.10/0.30 cnf(c0, axiom, % 0.10/0.30 ~finite(set_intersection2(sK24,sK25))). % 0.10/0.30 cnf(c1, plain, % 0.10/0.30 ~finite(set_intersection2(sK24,sK25)), % 0.10/0.30 inference(start, [], [c0])). % 0.10/0.30 % 0.10/0.30 cnf(c2, axiom, % 0.10/0.30 finite(set_intersection2(X0,X1)) | ~finite(X0)). % 0.10/0.30 cnf(a0, assumption, % 0.10/0.30 set_intersection2(sK24,sK25) = set_intersection2(X0,X1)). % 0.10/0.30 cnf(c3, plain, % 0.10/0.30 $false, % 0.10/0.30 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])). % 0.10/0.30 cnf(c4, plain, % 0.10/0.30 ~finite(X0), % 0.10/0.30 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])). % 0.10/0.30 % 0.10/0.30 cnf(c5, axiom, % 0.10/0.30 finite(sK24)). % 0.10/0.30 cnf(a1, assumption, % 0.10/0.30 X0 = sK24). % 0.10/0.30 cnf(c6, plain, % 0.10/0.30 $false, % 0.10/0.30 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])). % 0.10/0.30 cnf(c7, plain, % 0.10/0.30 $false, % 0.10/0.30 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])). % 0.10/0.30 % 0.10/0.30 cnf(c8, plain, % 0.10/0.30 $false, % 0.10/0.30 inference(constraint_solving, [ % 0.10/0.30 bind(X0, sK24), % 0.10/0.30 bind(X1, sK25) % 0.10/0.30 ], % 0.10/0.30 [a0, a1])). % 0.10/0.30 % 0.10/0.30 % SZS output end IncompleteProof %------------------------------------------------------------------------------