TSTP Solution File: ANA003-4 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : ANA003-4 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% Computer : n025.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 : Thu Jul 14 19:08:21 EDT 2022
% Result : Unsatisfiable 10.43s 1.65s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : ANA003-4 : TPTP v8.1.0. Released v1.0.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 : n025.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 : Fri Jul 8 03:35:29 EDT 2022
% 0.12/0.34 % CPUTime :
% 10.43/1.65 % SZS status Unsatisfiable
% 10.43/1.65 % SZS output begin IncompleteProof
% 10.43/1.65 cnf(c0, axiom,
% 10.43/1.65 ~less_or_equal(add(absolute(add(f(xs(X0)),negate(f(a_real_number)))),absolute(add(g(xs(X0)),negate(g(a_real_number))))),epsilon_0) | less_or_equal(X0,n0)).
% 10.43/1.65 cnf(c1, plain,
% 10.43/1.65 ~less_or_equal(add(absolute(add(f(xs(X0)),negate(f(a_real_number)))),absolute(add(g(xs(X0)),negate(g(a_real_number))))),epsilon_0) | less_or_equal(X0,n0),
% 10.43/1.65 inference(start, [], [c0])).
% 10.43/1.65
% 10.43/1.65 cnf(c2, axiom,
% 10.43/1.65 less_or_equal(add(X1,X2),X3) | ~less_or_equal(X2,half(X3)) | ~less_or_equal(X1,half(X3))).
% 10.43/1.65 cnf(a0, assumption,
% 10.43/1.65 add(absolute(add(f(xs(X0)),negate(f(a_real_number)))),absolute(add(g(xs(X0)),negate(g(a_real_number))))) = add(X1,X2)).
% 10.43/1.65 cnf(a1, assumption,
% 10.43/1.65 epsilon_0 = X3).
% 10.43/1.65 cnf(c3, plain,
% 10.43/1.65 less_or_equal(X0,n0),
% 10.43/1.65 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 10.43/1.65 cnf(c4, plain,
% 10.43/1.65 ~less_or_equal(X2,half(X3)) | ~less_or_equal(X1,half(X3)),
% 10.43/1.65 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 10.43/1.65
% 10.43/1.65 cnf(c5, axiom,
% 10.43/1.65 less_or_equal(absolute(add(g(X4),negate(g(a_real_number)))),X5) | ~less_or_equal(absolute(add(X4,negate(a_real_number))),delta_2(X5)) | less_or_equal(X5,n0)).
% 10.43/1.65 cnf(a2, assumption,
% 10.43/1.65 X2 = absolute(add(g(X4),negate(g(a_real_number))))).
% 10.43/1.65 cnf(a3, assumption,
% 10.43/1.65 half(X3) = X5).
% 10.43/1.65 cnf(c6, plain,
% 10.43/1.65 ~less_or_equal(X1,half(X3)),
% 10.43/1.65 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 10.43/1.65 cnf(c7, plain,
% 10.43/1.65 ~less_or_equal(absolute(add(X4,negate(a_real_number))),delta_2(X5)) | less_or_equal(X5,n0),
% 10.43/1.65 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 10.43/1.65
% 10.43/1.65 cnf(c8, axiom,
% 10.43/1.65 less_or_equal(X6,X7) | ~less_or_equal(X6,minimum(X8,X7))).
% 10.43/1.65 cnf(a4, assumption,
% 10.43/1.65 absolute(add(X4,negate(a_real_number))) = X6).
% 10.43/1.65 cnf(a5, assumption,
% 10.43/1.65 delta_2(X5) = X7).
% 10.43/1.65 cnf(c9, plain,
% 10.43/1.65 less_or_equal(X5,n0),
% 10.43/1.65 inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])).
% 10.43/1.65 cnf(c10, plain,
% 10.43/1.65 ~less_or_equal(X6,minimum(X8,X7)),
% 10.43/1.65 inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])).
% 10.43/1.65
% 10.43/1.65 cnf(c11, axiom,
% 10.43/1.65 less_or_equal(absolute(add(xs(X9),negate(a_real_number))),X9) | less_or_equal(X9,n0)).
% 10.43/1.65 cnf(a6, assumption,
% 10.43/1.65 X6 = absolute(add(xs(X9),negate(a_real_number)))).
% 10.43/1.65 cnf(a7, assumption,
% 10.43/1.65 minimum(X8,X7) = X9).
% 10.43/1.65 cnf(c12, plain,
% 10.43/1.65 $false,
% 10.43/1.65 inference(strict_predicate_extension, [assumptions([a6, a7])], [c10, c11])).
% 10.43/1.65 cnf(c13, plain,
% 10.43/1.65 less_or_equal(X9,n0),
% 10.43/1.65 inference(strict_predicate_extension, [assumptions([a6, a7])], [c10, c11])).
% 10.43/1.65
% 10.43/1.65 cnf(c14, axiom,
% 10.43/1.65 ~less_or_equal(minimum(X10,X11),n0) | less_or_equal(X11,n0) | less_or_equal(X10,n0)).
% 10.43/1.65 cnf(a8, assumption,
% 10.43/1.65 X9 = minimum(X10,X11)).
% 10.43/1.65 cnf(a9, assumption,
% 10.43/1.65 n0 = n0).
% 10.43/1.65 cnf(c15, plain,
% 10.43/1.65 $false,
% 10.43/1.65 inference(strict_predicate_extension, [assumptions([a8, a9])], [c13, c14])).
% 10.43/1.65 cnf(c16, plain,
% 10.43/1.65 less_or_equal(X11,n0) | less_or_equal(X10,n0),
% 10.43/1.65 inference(strict_predicate_extension, [assumptions([a8, a9])], [c13, c14])).
% 10.43/1.65
% 10.43/1.65 cnf(c17, axiom,
% 10.43/1.65 ~less_or_equal(delta_2(X12),n0) | less_or_equal(X12,n0)).
% 10.43/1.65 cnf(a10, assumption,
% 10.43/1.65 X11 = delta_2(X12)).
% 10.43/1.65 cnf(a11, assumption,
% 10.43/1.65 n0 = n0).
% 10.43/1.65 cnf(c18, plain,
% 10.43/1.65 less_or_equal(X10,n0),
% 10.43/1.65 inference(strict_predicate_extension, [assumptions([a10, a11])], [c16, c17])).
% 10.43/1.65 cnf(c19, plain,
% 10.43/1.65 less_or_equal(X12,n0),
% 10.43/1.65 inference(strict_predicate_extension, [assumptions([a10, a11])], [c16, c17])).
% 10.43/1.65
% 10.43/1.65 cnf(c20, axiom,
% 10.43/1.65 ~less_or_equal(half(X13),n0) | less_or_equal(X13,n0)).
% 10.43/1.65 cnf(a12, assumption,
% 10.43/1.65 X12 = half(X13)).
% 10.43/1.65 cnf(a13, assumption,
% 10.43/1.65 n0 = n0).
% 10.43/1.65 cnf(c21, plain,
% 10.43/1.65 $false,
% 10.43/1.65 inference(strict_predicate_extension, [assumptions([a12, a13])], [c19, c20])).
% 10.43/1.65 cnf(c22, plain,
% 10.43/1.65 less_or_equal(X13,n0),
% 10.43/1.65 inference(strict_predicate_extension, [assumptions([a12, a13])], [c19, c20])).
% 10.43/1.65
% 10.43/1.65 cnf(c23, axiom,
% 10.43/1.65 ~less_or_equal(epsilon_0,n0)).
% 10.43/1.65 cnf(a14, assumption,
% 10.43/1.65 X13 = epsilon_0).
% 10.43/1.65 cnf(a15, assumption,
% 10.43/1.65 n0 = n0).
% 10.43/1.65 cnf(c24, plain,
% 10.43/1.65 $false,
% 10.43/1.65 inference(strict_predicate_extension, [assumptions([a14, a15])], [c22, c23])).
% 10.43/1.65 cnf(c25, plain,
% 10.43/1.65 $false,
% 10.43/1.65 inference(strict_predicate_extension, [assumptions([a14, a15])], [c22, c23])).
% 10.43/1.65
% 10.43/1.65 cnf(c26, axiom,
% 10.43/1.65 ~less_or_equal(delta_1(X14),n0) | less_or_equal(X14,n0)).
% 10.43/1.65 cnf(a16, assumption,
% 10.43/1.65 X10 = delta_1(X14)).
% 10.43/1.65 cnf(a17, assumption,
% 10.43/1.65 n0 = n0).
% 10.43/1.65 cnf(c27, plain,
% 10.43/1.65 $false,
% 10.43/1.65 inference(strict_predicate_extension, [assumptions([a16, a17])], [c18, c26])).
% 10.43/1.65 cnf(c28, plain,
% 10.43/1.65 less_or_equal(X14,n0),
% 10.43/1.65 inference(strict_predicate_extension, [assumptions([a16, a17])], [c18, c26])).
% 10.43/1.65
% 10.43/1.65 cnf(c29, plain,
% 10.43/1.65 ~less_or_equal(X12,n0)).
% 10.43/1.65 cnf(a18, assumption,
% 10.43/1.65 X14 = X12).
% 10.43/1.65 cnf(a19, assumption,
% 10.43/1.65 n0 = n0).
% 10.43/1.65 cnf(c30, plain,
% 10.43/1.65 $false,
% 10.43/1.65 inference(predicate_reduction, [assumptions([a18, a19])], [c28, c29])).
% 10.43/1.65
% 10.43/1.65 cnf(c31, plain,
% 10.43/1.65 ~less_or_equal(X12,n0)).
% 10.43/1.65 cnf(a20, assumption,
% 10.43/1.65 X5 = X12).
% 10.43/1.65 cnf(a21, assumption,
% 10.43/1.65 n0 = n0).
% 10.43/1.65 cnf(c32, plain,
% 10.43/1.65 $false,
% 10.43/1.65 inference(predicate_reduction, [assumptions([a20, a21])], [c9, c31])).
% 10.43/1.65
% 10.43/1.65 cnf(c33, axiom,
% 10.43/1.65 less_or_equal(absolute(add(f(X15),negate(f(a_real_number)))),X16) | ~less_or_equal(absolute(add(X15,negate(a_real_number))),delta_1(X16)) | less_or_equal(X16,n0)).
% 10.43/1.65 cnf(a22, assumption,
% 10.43/1.65 X1 = absolute(add(f(X15),negate(f(a_real_number))))).
% 10.43/1.65 cnf(a23, assumption,
% 10.43/1.65 half(X3) = X16).
% 10.43/1.65 cnf(c34, plain,
% 10.43/1.65 $false,
% 10.43/1.65 inference(strict_predicate_extension, [assumptions([a22, a23])], [c6, c33])).
% 10.43/1.65 cnf(c35, plain,
% 10.43/1.65 ~less_or_equal(absolute(add(X15,negate(a_real_number))),delta_1(X16)) | less_or_equal(X16,n0),
% 10.43/1.65 inference(strict_predicate_extension, [assumptions([a22, a23])], [c6, c33])).
% 10.43/1.65
% 10.43/1.65 cnf(c36, axiom,
% 10.43/1.65 less_or_equal(X17,X18) | ~less_or_equal(X17,minimum(X18,X19))).
% 10.43/1.65 cnf(a24, assumption,
% 10.43/1.65 absolute(add(X15,negate(a_real_number))) = X17).
% 10.43/1.65 cnf(a25, assumption,
% 10.43/1.65 delta_1(X16) = X18).
% 10.43/1.65 cnf(c37, plain,
% 10.43/1.65 less_or_equal(X16,n0),
% 10.43/1.65 inference(strict_predicate_extension, [assumptions([a24, a25])], [c35, c36])).
% 10.43/1.65 cnf(c38, plain,
% 10.43/1.65 ~less_or_equal(X17,minimum(X18,X19)),
% 10.43/1.65 inference(strict_predicate_extension, [assumptions([a24, a25])], [c35, c36])).
% 10.43/1.65
% 10.43/1.65 cnf(c39, plain,
% 10.43/1.65 less_or_equal(X6,minimum(X8,X7))).
% 10.43/1.65 cnf(a26, assumption,
% 10.43/1.65 X17 = X6).
% 10.43/1.65 cnf(a27, assumption,
% 10.43/1.65 minimum(X18,X19) = minimum(X8,X7)).
% 10.43/1.65 cnf(c40, plain,
% 10.43/1.65 $false,
% 10.43/1.65 inference(predicate_reduction, [assumptions([a26, a27])], [c38, c39])).
% 10.43/1.65
% 10.43/1.65 cnf(c41, plain,
% 10.43/1.65 ~less_or_equal(X12,n0)).
% 10.43/1.65 cnf(a28, assumption,
% 10.43/1.65 X16 = X12).
% 10.43/1.65 cnf(a29, assumption,
% 10.43/1.65 n0 = n0).
% 10.43/1.65 cnf(c42, plain,
% 10.43/1.65 $false,
% 10.43/1.65 inference(predicate_reduction, [assumptions([a28, a29])], [c37, c41])).
% 10.43/1.65
% 10.43/1.65 cnf(c43, plain,
% 10.43/1.65 ~less_or_equal(X9,n0)).
% 10.43/1.65 cnf(a30, assumption,
% 10.43/1.65 X0 = X9).
% 10.43/1.65 cnf(a31, assumption,
% 10.43/1.65 n0 = n0).
% 10.43/1.65 cnf(c44, plain,
% 10.43/1.65 $false,
% 10.43/1.65 inference(predicate_reduction, [assumptions([a30, a31])], [c3, c43])).
% 10.43/1.65
% 10.43/1.65 cnf(c45, plain,
% 10.43/1.65 $false,
% 10.43/1.65 inference(constraint_solving, [
% 10.43/1.65 bind(X0, minimum(X8,X7)),
% 10.43/1.65 bind(X1, absolute(add(f(xs(X0)),negate(f(a_real_number))))),
% 10.43/1.65 bind(X2, absolute(add(g(xs(X0)),negate(g(a_real_number))))),
% 10.43/1.65 bind(X3, epsilon_0),
% 10.43/1.65 bind(X4, xs(X0)),
% 10.43/1.65 bind(X5, half(X3)),
% 10.43/1.65 bind(X6, absolute(add(X4,negate(a_real_number)))),
% 10.43/1.65 bind(X7, delta_2(X5)),
% 10.43/1.65 bind(X8, delta_1(X14)),
% 10.43/1.65 bind(X9, minimum(X8,X7)),
% 10.43/1.65 bind(X10, delta_1(X14)),
% 10.43/1.65 bind(X11, delta_2(X5)),
% 10.43/1.65 bind(X12, half(X3)),
% 10.43/1.65 bind(X13, epsilon_0),
% 10.43/1.65 bind(X14, half(X3)),
% 10.43/1.65 bind(X15, xs(X0)),
% 10.43/1.65 bind(X16, half(X3)),
% 10.43/1.65 bind(X17, absolute(add(X15,negate(a_real_number)))),
% 10.43/1.65 bind(X18, delta_1(X16)),
% 10.43/1.65 bind(X19, delta_2(X5))
% 10.43/1.65 ],
% 10.43/1.65 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17, a18, a19, a20, a21, a22, a23, a24, a25, a26, a27, a28, a29, a30, a31])).
% 10.43/1.65
% 10.43/1.65 % SZS output end IncompleteProof
%------------------------------------------------------------------------------