%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : FLD058-1 : TPTP v8.1.0. Bugfixed v2.1.0. % Transfm : none % Format : tptp:raw % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % Computer : n021.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 : Sat Jul 16 02:16:01 EDT 2022 % Result : Unsatisfiable 0.20s 0.51s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : FLD058-1 : TPTP v8.1.0. Bugfixed v2.1.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 : n021.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 6 11:12:20 EDT 2022 % 0.12/0.34 % CPUTime : % 0.20/0.51 % SZS status Unsatisfiable % 0.20/0.51 % SZS output begin IncompleteProof % 0.20/0.51 cnf(c0, axiom, % 0.20/0.51 less_or_equal(a,b)). % 0.20/0.51 cnf(c1, plain, % 0.20/0.51 less_or_equal(a,b), % 0.20/0.51 inference(start, [], [c0])). % 0.20/0.51 % 0.20/0.51 cnf(c2, axiom, % 0.20/0.51 ~less_or_equal(X0,X1) | ~less_or_equal(X1,X0) | equalish(X1,X0)). % 0.20/0.51 cnf(a0, assumption, % 0.20/0.51 a = X1). % 0.20/0.51 cnf(a1, assumption, % 0.20/0.51 b = X0). % 0.20/0.51 cnf(c3, plain, % 0.20/0.51 $false, % 0.20/0.51 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 0.20/0.51 cnf(c4, plain, % 0.20/0.51 ~less_or_equal(X0,X1) | equalish(X1,X0), % 0.20/0.51 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 0.20/0.51 % 0.20/0.51 cnf(c5, axiom, % 0.20/0.51 ~equalish(X2,X3) | ~less_or_equal(X2,X4) | less_or_equal(X3,X4)). % 0.20/0.51 cnf(a2, assumption, % 0.20/0.51 X0 = X3). % 0.20/0.51 cnf(a3, assumption, % 0.20/0.51 X1 = X4). % 0.20/0.51 cnf(c6, plain, % 0.20/0.51 equalish(X1,X0), % 0.20/0.51 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])). % 0.20/0.51 cnf(c7, plain, % 0.20/0.51 ~equalish(X2,X3) | ~less_or_equal(X2,X4), % 0.20/0.51 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])). % 0.20/0.51 % 0.20/0.51 cnf(c8, axiom, % 0.20/0.51 ~equalish(X5,X6) | equalish(X6,X5)). % 0.20/0.51 cnf(a4, assumption, % 0.20/0.51 X2 = X6). % 0.20/0.51 cnf(a5, assumption, % 0.20/0.51 X3 = X5). % 0.20/0.51 cnf(c9, plain, % 0.20/0.51 ~less_or_equal(X2,X4), % 0.20/0.51 inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])). % 0.20/0.51 cnf(c10, plain, % 0.20/0.51 ~equalish(X5,X6), % 0.20/0.51 inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])). % 0.20/0.51 % 0.20/0.51 cnf(c11, axiom, % 0.20/0.51 equalish(b,additive_identity)). % 0.20/0.51 cnf(a6, assumption, % 0.20/0.51 X5 = b). % 0.20/0.51 cnf(a7, assumption, % 0.20/0.51 X6 = additive_identity). % 0.20/0.51 cnf(c12, plain, % 0.20/0.51 $false, % 0.20/0.51 inference(strict_predicate_extension, [assumptions([a6, a7])], [c10, c11])). % 0.20/0.51 cnf(c13, plain, % 0.20/0.51 $false, % 0.20/0.51 inference(strict_predicate_extension, [assumptions([a6, a7])], [c10, c11])). % 0.20/0.51 % 0.20/0.51 cnf(c14, axiom, % 0.20/0.51 less_or_equal(additive_identity,a)). % 0.20/0.51 cnf(a8, assumption, % 0.20/0.51 X2 = additive_identity). % 0.20/0.51 cnf(a9, assumption, % 0.20/0.51 X4 = a). % 0.20/0.51 cnf(c15, plain, % 0.20/0.51 $false, % 0.20/0.51 inference(strict_predicate_extension, [assumptions([a8, a9])], [c9, c14])). % 0.20/0.51 cnf(c16, plain, % 0.20/0.51 $false, % 0.20/0.51 inference(strict_predicate_extension, [assumptions([a8, a9])], [c9, c14])). % 0.20/0.51 % 0.20/0.51 cnf(c17, axiom, % 0.20/0.51 ~equalish(X7,X8) | ~equalish(X9,X7) | equalish(X9,X8)). % 0.20/0.51 cnf(a10, assumption, % 0.20/0.51 X1 = X9). % 0.20/0.51 cnf(a11, assumption, % 0.20/0.51 X0 = X7). % 0.20/0.51 cnf(c18, plain, % 0.20/0.51 $false, % 0.20/0.51 inference(strict_predicate_extension, [assumptions([a10, a11])], [c6, c17])). % 0.20/0.51 cnf(c19, plain, % 0.20/0.51 ~equalish(X7,X8) | equalish(X9,X8), % 0.20/0.51 inference(strict_predicate_extension, [assumptions([a10, a11])], [c6, c17])). % 0.20/0.51 % 0.20/0.51 cnf(c20, plain, % 0.20/0.51 equalish(X5,X6)). % 0.20/0.51 cnf(a12, assumption, % 0.20/0.51 X7 = X5). % 0.20/0.51 cnf(a13, assumption, % 0.20/0.51 X8 = X6). % 0.20/0.51 cnf(c21, plain, % 0.20/0.51 equalish(X9,X8), % 0.20/0.51 inference(predicate_reduction, [assumptions([a12, a13])], [c19, c20])). % 0.20/0.51 % 0.20/0.51 cnf(c22, axiom, % 0.20/0.51 ~equalish(a,additive_identity)). % 0.20/0.51 cnf(a14, assumption, % 0.20/0.51 X9 = a). % 0.20/0.51 cnf(a15, assumption, % 0.20/0.51 X8 = additive_identity). % 0.20/0.51 cnf(c23, plain, % 0.20/0.51 $false, % 0.20/0.51 inference(strict_predicate_extension, [assumptions([a14, a15])], [c21, c22])). % 0.20/0.51 cnf(c24, plain, % 0.20/0.51 $false, % 0.20/0.51 inference(strict_predicate_extension, [assumptions([a14, a15])], [c21, c22])). % 0.20/0.51 % 0.20/0.51 cnf(c25, plain, % 0.20/0.51 $false, % 0.20/0.51 inference(constraint_solving, [ % 0.20/0.51 bind(X0, b), % 0.20/0.51 bind(X1, a), % 0.20/0.51 bind(X2, additive_identity), % 0.20/0.51 bind(X3, b), % 0.20/0.51 bind(X4, a), % 0.20/0.51 bind(X5, b), % 0.20/0.51 bind(X6, additive_identity), % 0.20/0.51 bind(X7, b), % 0.20/0.51 bind(X8, additive_identity), % 0.20/0.51 bind(X9, a) % 0.20/0.51 ], % 0.20/0.51 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15])). % 0.20/0.51 % 0.20/0.51 % SZS output end IncompleteProof %------------------------------------------------------------------------------