%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : SEU294+2 : 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 : n011.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.20s 0.47s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.11 % Problem : SEU294+2 : TPTP v8.1.0. Released v3.3.0. % 0.03/0.12 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.12/0.33 % Computer : n011.cluster.edu % 0.12/0.33 % Model : x86_64 x86_64 % 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.33 % Memory : 8042.1875MB % 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.33 % CPULimit : 300 % 0.12/0.33 % WCLimit : 600 % 0.12/0.33 % DateTime : Mon Jun 20 12:29:54 EDT 2022 % 0.12/0.33 % CPUTime : % 0.20/0.47 % SZS status Theorem % 0.20/0.47 % SZS output begin IncompleteProof % 0.20/0.47 cnf(c0, axiom, % 0.20/0.47 finite(sK438)). % 0.20/0.47 cnf(c1, plain, % 0.20/0.47 finite(sK438), % 0.20/0.47 inference(start, [], [c0])). % 0.20/0.47 % 0.20/0.47 cnf(c2, axiom, % 0.20/0.47 finite(X0) | ~element(X0,powerset(X1)) | ~finite(X1)). % 0.20/0.47 cnf(a0, assumption, % 0.20/0.47 sK438 = X1). % 0.20/0.47 cnf(c3, plain, % 0.20/0.47 $false, % 0.20/0.47 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])). % 0.20/0.47 cnf(c4, plain, % 0.20/0.47 finite(X0) | ~element(X0,powerset(X1)), % 0.20/0.47 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])). % 0.20/0.47 % 0.20/0.47 cnf(c5, axiom, % 0.20/0.47 ~finite(sK437)). % 0.20/0.47 cnf(a1, assumption, % 0.20/0.47 X0 = sK437). % 0.20/0.47 cnf(c6, plain, % 0.20/0.47 ~element(X0,powerset(X1)), % 0.20/0.47 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])). % 0.20/0.47 cnf(c7, plain, % 0.20/0.47 $false, % 0.20/0.47 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])). % 0.20/0.47 % 0.20/0.47 cnf(c8, axiom, % 0.20/0.47 element(X2,powerset(X3)) | ~subset(X2,X3)). % 0.20/0.47 cnf(a2, assumption, % 0.20/0.47 X0 = X2). % 0.20/0.47 cnf(a3, assumption, % 0.20/0.47 powerset(X1) = powerset(X3)). % 0.20/0.47 cnf(c9, plain, % 0.20/0.47 $false, % 0.20/0.47 inference(strict_predicate_extension, [assumptions([a2, a3])], [c6, c8])). % 0.20/0.47 cnf(c10, plain, % 0.20/0.47 ~subset(X2,X3), % 0.20/0.47 inference(strict_predicate_extension, [assumptions([a2, a3])], [c6, c8])). % 0.20/0.47 % 0.20/0.47 cnf(c11, axiom, % 0.20/0.47 subset(sK437,sK438)). % 0.20/0.47 cnf(a4, assumption, % 0.20/0.47 X2 = sK437). % 0.20/0.47 cnf(a5, assumption, % 0.20/0.47 X3 = sK438). % 0.20/0.47 cnf(c12, plain, % 0.20/0.47 $false, % 0.20/0.47 inference(strict_predicate_extension, [assumptions([a4, a5])], [c10, c11])). % 0.20/0.47 cnf(c13, plain, % 0.20/0.47 $false, % 0.20/0.47 inference(strict_predicate_extension, [assumptions([a4, a5])], [c10, c11])). % 0.20/0.47 % 0.20/0.47 cnf(c14, plain, % 0.20/0.47 $false, % 0.20/0.47 inference(constraint_solving, [ % 0.20/0.47 bind(X0, sK437), % 0.20/0.47 bind(X1, sK438), % 0.20/0.47 bind(X2, sK437), % 0.20/0.47 bind(X3, sK438) % 0.20/0.47 ], % 0.20/0.47 [a0, a1, a2, a3, a4, a5])). % 0.20/0.47 % 0.20/0.47 % SZS output end IncompleteProof %------------------------------------------------------------------------------