%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : FLD055-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 : n017.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:00 EDT 2022 % Result : Unsatisfiable 6.39s 1.25s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.08/0.13 % Problem : FLD055-1 : TPTP v8.1.0. Bugfixed v2.1.0. % 0.08/0.14 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.15/0.35 % Computer : n017.cluster.edu % 0.15/0.35 % Model : x86_64 x86_64 % 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.15/0.35 % Memory : 8042.1875MB % 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.15/0.35 % CPULimit : 300 % 0.15/0.35 % WCLimit : 600 % 0.15/0.35 % DateTime : Mon Jun 6 19:37:16 EDT 2022 % 0.15/0.36 % CPUTime : % 6.39/1.25 % SZS status Unsatisfiable % 6.39/1.25 % SZS output begin IncompleteProof % 6.39/1.25 cnf(c0, axiom, % 6.39/1.25 ~less_or_equal(a,c)). % 6.39/1.25 cnf(c1, plain, % 6.39/1.25 ~less_or_equal(a,c), % 6.39/1.25 inference(start, [], [c0])). % 6.39/1.25 % 6.39/1.25 cnf(c2, axiom, % 6.39/1.25 ~less_or_equal(X0,X1) | ~less_or_equal(X2,X0) | less_or_equal(X2,X1)). % 6.39/1.25 cnf(a0, assumption, % 6.39/1.25 a = X2). % 6.39/1.25 cnf(a1, assumption, % 6.39/1.25 c = X1). % 6.39/1.25 cnf(c3, plain, % 6.39/1.25 $false, % 6.39/1.25 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 6.39/1.25 cnf(c4, plain, % 6.39/1.25 ~less_or_equal(X0,X1) | ~less_or_equal(X2,X0), % 6.39/1.25 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 6.39/1.25 % 6.39/1.25 cnf(c5, axiom, % 6.39/1.25 ~equalish(X3,X4) | ~less_or_equal(X3,X5) | less_or_equal(X4,X5)). % 6.39/1.25 cnf(a2, assumption, % 6.39/1.25 X0 = X4). % 6.39/1.25 cnf(a3, assumption, % 6.39/1.25 X1 = X5). % 6.39/1.25 cnf(c6, plain, % 6.39/1.25 ~less_or_equal(X2,X0), % 6.39/1.25 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])). % 6.39/1.25 cnf(c7, plain, % 6.39/1.25 ~equalish(X3,X4) | ~less_or_equal(X3,X5), % 6.39/1.25 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])). % 6.39/1.25 % 6.39/1.25 cnf(c8, axiom, % 6.39/1.25 ~equalish(X6,X7) | equalish(X7,X6)). % 6.39/1.25 cnf(a4, assumption, % 6.39/1.25 X3 = X7). % 6.39/1.25 cnf(a5, assumption, % 6.39/1.25 X4 = X6). % 6.39/1.25 cnf(c9, plain, % 6.39/1.25 ~less_or_equal(X3,X5), % 6.39/1.25 inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])). % 6.39/1.25 cnf(c10, plain, % 6.39/1.25 ~equalish(X6,X7), % 6.39/1.25 inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])). % 6.39/1.25 % 6.39/1.25 cnf(c11, axiom, % 6.39/1.25 equalish(b,c)). % 6.39/1.25 cnf(a6, assumption, % 6.39/1.25 X6 = b). % 6.39/1.25 cnf(a7, assumption, % 6.39/1.25 X7 = c). % 6.39/1.25 cnf(c12, plain, % 6.39/1.25 $false, % 6.39/1.25 inference(strict_predicate_extension, [assumptions([a6, a7])], [c10, c11])). % 6.39/1.25 cnf(c13, plain, % 6.39/1.25 $false, % 6.39/1.25 inference(strict_predicate_extension, [assumptions([a6, a7])], [c10, c11])). % 6.39/1.25 % 6.39/1.25 cnf(c14, axiom, % 6.39/1.25 ~defined(X8) | ~defined(X9) | less_or_equal(X8,X9) | less_or_equal(X9,X8)). % 6.39/1.25 cnf(a8, assumption, % 6.39/1.25 X3 = X8). % 6.39/1.25 cnf(a9, assumption, % 6.39/1.25 X5 = X9). % 6.39/1.25 cnf(c15, plain, % 6.39/1.25 $false, % 6.39/1.25 inference(strict_predicate_extension, [assumptions([a8, a9])], [c9, c14])). % 6.39/1.25 cnf(c16, plain, % 6.39/1.25 ~defined(X8) | ~defined(X9) | less_or_equal(X9,X8), % 6.39/1.25 inference(strict_predicate_extension, [assumptions([a8, a9])], [c9, c14])). % 6.39/1.25 % 6.39/1.25 cnf(c17, axiom, % 6.39/1.25 defined(c)). % 6.39/1.25 cnf(a10, assumption, % 6.39/1.25 X8 = c). % 6.39/1.25 cnf(c18, plain, % 6.39/1.25 ~defined(X9) | less_or_equal(X9,X8), % 6.39/1.25 inference(strict_predicate_extension, [assumptions([a10])], [c16, c17])). % 6.39/1.25 cnf(c19, plain, % 6.39/1.25 $false, % 6.39/1.25 inference(strict_predicate_extension, [assumptions([a10])], [c16, c17])). % 6.39/1.25 % 6.39/1.25 cnf(c20, plain, % 6.39/1.25 defined(X8)). % 6.39/1.25 cnf(a11, assumption, % 6.39/1.25 X9 = X8). % 6.39/1.25 cnf(c21, plain, % 6.39/1.25 less_or_equal(X9,X8), % 6.39/1.25 inference(predicate_reduction, [assumptions([a11])], [c18, c20])). % 6.39/1.25 % 6.39/1.25 cnf(c22, plain, % 6.39/1.25 ~less_or_equal(X3,X5)). % 6.39/1.25 cnf(a12, assumption, % 6.39/1.25 X9 = X3). % 6.39/1.25 cnf(a13, assumption, % 6.39/1.25 X8 = X5). % 6.39/1.25 cnf(c23, plain, % 6.39/1.25 $false, % 6.39/1.25 inference(predicate_reduction, [assumptions([a12, a13])], [c21, c22])). % 6.39/1.25 % 6.39/1.25 cnf(c24, axiom, % 6.39/1.25 less_or_equal(a,b)). % 6.39/1.25 cnf(a14, assumption, % 6.39/1.25 X2 = a). % 6.39/1.25 cnf(a15, assumption, % 6.39/1.25 X0 = b). % 6.39/1.25 cnf(c25, plain, % 6.39/1.25 $false, % 6.39/1.25 inference(strict_predicate_extension, [assumptions([a14, a15])], [c6, c24])). % 6.39/1.25 cnf(c26, plain, % 6.39/1.25 $false, % 6.39/1.25 inference(strict_predicate_extension, [assumptions([a14, a15])], [c6, c24])). % 6.39/1.25 % 6.39/1.25 cnf(c27, plain, % 6.39/1.25 $false, % 6.39/1.25 inference(constraint_solving, [ % 6.39/1.25 bind(X0, b), % 6.39/1.25 bind(X1, c), % 6.39/1.25 bind(X2, a), % 6.39/1.25 bind(X3, c), % 6.39/1.25 bind(X4, b), % 6.39/1.25 bind(X5, c), % 6.39/1.25 bind(X6, b), % 6.39/1.25 bind(X7, c), % 6.39/1.25 bind(X8, c), % 6.39/1.25 bind(X9, c) % 6.39/1.25 ], % 6.39/1.25 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15])). % 6.39/1.25 % 6.39/1.25 % SZS output end IncompleteProof %------------------------------------------------------------------------------