%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : SEU264+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 : n029.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:35 EDT 2022 % Result : Theorem 52.53s 7.11s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : SEU264+2 : TPTP v8.1.0. Released v3.3.0. % 0.03/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.13/0.33 % Computer : n029.cluster.edu % 0.13/0.33 % Model : x86_64 x86_64 % 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.33 % Memory : 8042.1875MB % 0.13/0.33 % 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 : Mon Jun 20 13:33:30 EDT 2022 % 0.13/0.34 % CPUTime : % 52.53/7.11 % SZS status Theorem % 52.53/7.11 % SZS output begin IncompleteProof % 52.53/7.11 cnf(c0, axiom, % 52.53/7.11 relation_of2_as_subset(sK231,sK230,sK228)). % 52.53/7.11 cnf(c1, plain, % 52.53/7.11 relation_of2_as_subset(sK231,sK230,sK228), % 52.53/7.11 inference(start, [], [c0])). % 52.53/7.11 % 52.53/7.11 cnf(c2, axiom, % 52.53/7.11 subset(relation_rng(X0),X1) | ~relation_of2_as_subset(X0,X2,X1)). % 52.53/7.11 cnf(a0, assumption, % 52.53/7.11 sK231 = X0). % 52.53/7.11 cnf(a1, assumption, % 52.53/7.11 sK230 = X2). % 52.53/7.11 cnf(a2, assumption, % 52.53/7.11 sK228 = X1). % 52.53/7.11 cnf(c3, plain, % 52.53/7.11 $false, % 52.53/7.11 inference(strict_predicate_extension, [assumptions([a0, a1, a2])], [c1, c2])). % 52.53/7.11 cnf(c4, plain, % 52.53/7.11 subset(relation_rng(X0),X1), % 52.53/7.11 inference(strict_predicate_extension, [assumptions([a0, a1, a2])], [c1, c2])). % 52.53/7.11 % 52.53/7.11 cnf(c5, axiom, % 52.53/7.11 subset(X3,X4) | ~subset(X5,X4) | ~subset(X3,X5)). % 52.53/7.11 cnf(a3, assumption, % 52.53/7.11 relation_rng(X0) = X3). % 52.53/7.11 cnf(a4, assumption, % 52.53/7.11 X1 = X5). % 52.53/7.11 cnf(c6, plain, % 52.53/7.11 $false, % 52.53/7.11 inference(strict_predicate_extension, [assumptions([a3, a4])], [c4, c5])). % 52.53/7.11 cnf(c7, plain, % 52.53/7.11 subset(X3,X4) | ~subset(X5,X4), % 52.53/7.11 inference(strict_predicate_extension, [assumptions([a3, a4])], [c4, c5])). % 52.53/7.11 % 52.53/7.11 cnf(c8, axiom, % 52.53/7.11 relation_of2_as_subset(X6,X7,X8) | ~subset(relation_rng(X6),X8) | ~relation_of2_as_subset(X6,X7,X9)). % 52.53/7.11 cnf(a5, assumption, % 52.53/7.11 X3 = relation_rng(X6)). % 52.53/7.11 cnf(a6, assumption, % 52.53/7.11 X4 = X8). % 52.53/7.11 cnf(c9, plain, % 52.53/7.11 ~subset(X5,X4), % 52.53/7.11 inference(strict_predicate_extension, [assumptions([a5, a6])], [c7, c8])). % 52.53/7.11 cnf(c10, plain, % 52.53/7.11 relation_of2_as_subset(X6,X7,X8) | ~relation_of2_as_subset(X6,X7,X9), % 52.53/7.11 inference(strict_predicate_extension, [assumptions([a5, a6])], [c7, c8])). % 52.53/7.11 % 52.53/7.11 cnf(c11, axiom, % 52.53/7.11 ~relation_of2_as_subset(sK231,sK230,sK229)). % 52.53/7.11 cnf(a7, assumption, % 52.53/7.11 X6 = sK231). % 52.53/7.11 cnf(a8, assumption, % 52.53/7.11 X7 = sK230). % 52.53/7.11 cnf(a9, assumption, % 52.53/7.11 X8 = sK229). % 52.53/7.11 cnf(c12, plain, % 52.53/7.11 ~relation_of2_as_subset(X6,X7,X9), % 52.53/7.11 inference(strict_predicate_extension, [assumptions([a7, a8, a9])], [c10, c11])). % 52.53/7.11 cnf(c13, plain, % 52.53/7.11 $false, % 52.53/7.11 inference(strict_predicate_extension, [assumptions([a7, a8, a9])], [c10, c11])). % 52.53/7.11 % 52.53/7.11 cnf(c14, plain, % 52.53/7.11 relation_of2_as_subset(sK231,sK230,sK228)). % 52.53/7.11 cnf(a10, assumption, % 52.53/7.11 X6 = sK231). % 52.53/7.11 cnf(a11, assumption, % 52.53/7.11 X7 = sK230). % 52.53/7.11 cnf(a12, assumption, % 52.53/7.11 X9 = sK228). % 52.53/7.11 cnf(c15, plain, % 52.53/7.11 $false, % 52.53/7.11 inference(predicate_reduction, [assumptions([a10, a11, a12])], [c12, c14])). % 52.53/7.11 % 52.53/7.11 cnf(c16, axiom, % 52.53/7.11 subset(sK228,sK229)). % 52.53/7.11 cnf(a13, assumption, % 52.53/7.11 X5 = sK228). % 52.53/7.11 cnf(a14, assumption, % 52.53/7.11 X4 = sK229). % 52.53/7.11 cnf(c17, plain, % 52.53/7.11 $false, % 52.53/7.11 inference(strict_predicate_extension, [assumptions([a13, a14])], [c9, c16])). % 52.53/7.11 cnf(c18, plain, % 52.53/7.11 $false, % 52.53/7.11 inference(strict_predicate_extension, [assumptions([a13, a14])], [c9, c16])). % 52.53/7.11 % 52.53/7.11 cnf(c19, plain, % 52.53/7.11 $false, % 52.53/7.11 inference(constraint_solving, [ % 52.53/7.11 bind(X0, sK231), % 52.53/7.11 bind(X1, sK228), % 52.53/7.11 bind(X2, sK230), % 52.53/7.11 bind(X3, relation_rng(X0)), % 52.53/7.11 bind(X4, sK229), % 52.53/7.11 bind(X5, sK228), % 52.53/7.11 bind(X6, sK231), % 52.53/7.11 bind(X7, sK230), % 52.53/7.11 bind(X8, sK229), % 52.53/7.11 bind(X9, sK228) % 52.53/7.11 ], % 52.53/7.11 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14])). % 52.53/7.11 % 52.53/7.11 % SZS output end IncompleteProof %------------------------------------------------------------------------------