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