TSTP Solution File: HEN008-4 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : HEN008-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 : 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 : Sat Jul 16 12:56:45 EDT 2022
% Result : Unsatisfiable 153.32s 26.11s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12 % Problem : HEN008-4 : TPTP v8.1.0. Released v1.0.0.
% 0.08/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.13/0.35 % Computer : n029.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Fri Jul 1 13:29:54 EDT 2022
% 0.13/0.35 % CPUTime :
% 153.32/26.11 % SZS status Unsatisfiable
% 153.32/26.11 % SZS output begin IncompleteProof
% 153.32/26.11 cnf(c0, axiom,
% 153.32/26.11 ~less_equal(divide(a,c),divide(b,c))).
% 153.32/26.11 cnf(c1, plain,
% 153.32/26.11 ~less_equal(divide(a,c),divide(b,c)),
% 153.32/26.11 inference(start, [], [c0])).
% 153.32/26.11
% 153.32/26.11 cnf(c2, axiom,
% 153.32/26.11 less_equal(X0,X1) | divide(X0,X1) != zero).
% 153.32/26.11 cnf(a0, assumption,
% 153.32/26.11 divide(a,c) = X0).
% 153.32/26.11 cnf(a1, assumption,
% 153.32/26.11 divide(b,c) = X1).
% 153.32/26.11 cnf(c3, plain,
% 153.32/26.11 $false,
% 153.32/26.11 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 153.32/26.11 cnf(c4, plain,
% 153.32/26.11 divide(X0,X1) != zero,
% 153.32/26.11 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 153.32/26.11
% 153.32/26.11 cnf(c5, axiom,
% 153.32/26.11 X2 = X3 | ~less_equal(X3,X2) | ~less_equal(X2,X3)).
% 153.32/26.11 cnf(a2, assumption,
% 153.32/26.11 divide(X0,X1) = X2).
% 153.32/26.11 cnf(c6, plain,
% 153.32/26.11 $false,
% 153.32/26.11 inference(variable_extension, [assumptions([a2])], [c4, c5])).
% 153.32/26.11 cnf(c7, plain,
% 153.32/26.11 ~less_equal(X3,X2) | ~less_equal(X2,X3),
% 153.32/26.11 inference(variable_extension, [assumptions([a2])], [c4, c5])).
% 153.32/26.11 cnf(c8, plain,
% 153.32/26.11 X3 != X4 | X4 != zero,
% 153.32/26.11 inference(variable_extension, [assumptions([a2])], [c4, c5])).
% 153.32/26.11
% 153.32/26.11 cnf(a3, assumption,
% 153.32/26.11 X3 = X4).
% 153.32/26.11 cnf(c9, plain,
% 153.32/26.11 X4 != zero,
% 153.32/26.11 inference(reflexivity, [assumptions([a3])], [c8])).
% 153.32/26.11
% 153.32/26.11 cnf(a4, assumption,
% 153.32/26.11 X4 = zero).
% 153.32/26.11 cnf(c10, plain,
% 153.32/26.11 $false,
% 153.32/26.11 inference(reflexivity, [assumptions([a4])], [c9])).
% 153.32/26.11
% 153.32/26.11 cnf(c11, axiom,
% 153.32/26.11 less_equal(zero,X5)).
% 153.32/26.11 cnf(a5, assumption,
% 153.32/26.11 X3 = zero).
% 153.32/26.11 cnf(a6, assumption,
% 153.32/26.11 X2 = X5).
% 153.32/26.11 cnf(c12, plain,
% 153.32/26.11 ~less_equal(X2,X3),
% 153.32/26.11 inference(strict_predicate_extension, [assumptions([a5, a6])], [c7, c11])).
% 153.32/26.11 cnf(c13, plain,
% 153.32/26.11 $false,
% 153.32/26.11 inference(strict_predicate_extension, [assumptions([a5, a6])], [c7, c11])).
% 153.32/26.11
% 153.32/26.11 cnf(c14, axiom,
% 153.32/26.11 less_equal(divide(divide(X6,X7),divide(X8,X7)),divide(divide(X6,X8),X7))).
% 153.32/26.11 cnf(a7, assumption,
% 153.32/26.11 X9 = X2).
% 153.32/26.11 cnf(a8, assumption,
% 153.32/26.11 X10 = X3).
% 153.32/26.11 cnf(c15, plain,
% 153.32/26.11 $false,
% 153.32/26.11 inference(lazy_predicate_extension, [assumptions([a7, a8])], [c12, c14])).
% 153.32/26.11 cnf(c16, plain,
% 153.32/26.11 $false,
% 153.32/26.11 inference(lazy_predicate_extension, [assumptions([a7, a8])], [c12, c14])).
% 153.32/26.11 cnf(c17, plain,
% 153.32/26.11 divide(divide(X6,X7),divide(X8,X7)) != X9 | divide(divide(X6,X8),X7) != X10,
% 153.32/26.11 inference(lazy_predicate_extension, [assumptions([a7, a8])], [c12, c14])).
% 153.32/26.11
% 153.32/26.11 cnf(a9, assumption,
% 153.32/26.11 divide(divide(X6,X7),divide(X8,X7)) = X9).
% 153.32/26.11 cnf(c18, plain,
% 153.32/26.11 divide(divide(X6,X8),X7) != X10,
% 153.32/26.11 inference(reflexivity, [assumptions([a9])], [c17])).
% 153.32/26.11
% 153.32/26.11 cnf(c19, axiom,
% 153.32/26.11 divide(X11,X12) = zero | ~less_equal(X11,X12)).
% 153.32/26.11 cnf(a10, assumption,
% 153.32/26.11 divide(X6,X8) = divide(X11,X12)).
% 153.32/26.11 cnf(c20, plain,
% 153.32/26.11 $false,
% 153.32/26.11 inference(strict_function_extension, [assumptions([a10])], [c18, c19])).
% 153.32/26.11 cnf(c21, plain,
% 153.32/26.11 ~less_equal(X11,X12),
% 153.32/26.11 inference(strict_function_extension, [assumptions([a10])], [c18, c19])).
% 153.32/26.11 cnf(c22, plain,
% 153.32/26.11 X13 != zero | divide(X13,X7) != X10,
% 153.32/26.11 inference(strict_function_extension, [assumptions([a10])], [c18, c19])).
% 153.32/26.11
% 153.32/26.11 cnf(a11, assumption,
% 153.32/26.11 X13 = zero).
% 153.32/26.11 cnf(c23, plain,
% 153.32/26.11 divide(X13,X7) != X10,
% 153.32/26.11 inference(reflexivity, [assumptions([a11])], [c22])).
% 153.32/26.11
% 153.32/26.11 cnf(c24, axiom,
% 153.32/26.11 zero = divide(zero,X14)).
% 153.32/26.11 cnf(a12, assumption,
% 153.32/26.11 divide(X13,X7) = divide(zero,X14)).
% 153.32/26.11 cnf(c25, plain,
% 153.32/26.11 $false,
% 153.32/26.11 inference(strict_function_extension, [assumptions([a12])], [c23, c24])).
% 153.32/26.11 cnf(c26, plain,
% 153.32/26.11 $false,
% 153.32/26.11 inference(strict_function_extension, [assumptions([a12])], [c23, c24])).
% 153.32/26.11 cnf(c27, plain,
% 153.32/26.11 X15 != zero | X15 != X10,
% 153.32/26.11 inference(strict_function_extension, [assumptions([a12])], [c23, c24])).
% 153.32/26.11
% 153.32/26.11 cnf(a13, assumption,
% 153.32/26.11 X15 = zero).
% 153.32/26.11 cnf(c28, plain,
% 153.32/26.11 X15 != X10,
% 153.32/26.11 inference(reflexivity, [assumptions([a13])], [c27])).
% 153.32/26.11
% 153.32/26.11 cnf(a14, assumption,
% 153.32/26.11 X15 = X10).
% 153.32/26.11 cnf(c29, plain,
% 153.32/26.11 $false,
% 153.32/26.11 inference(reflexivity, [assumptions([a14])], [c28])).
% 153.32/26.11
% 153.32/26.11 cnf(c30, axiom,
% 153.32/26.11 less_equal(a,b)).
% 153.32/26.11 cnf(a15, assumption,
% 153.32/26.11 X11 = a).
% 153.32/26.11 cnf(a16, assumption,
% 153.32/26.11 X12 = b).
% 153.32/26.11 cnf(c31, plain,
% 153.32/26.11 $false,
% 153.32/26.11 inference(strict_predicate_extension, [assumptions([a15, a16])], [c21, c30])).
% 153.32/26.11 cnf(c32, plain,
% 153.32/26.11 $false,
% 153.32/26.11 inference(strict_predicate_extension, [assumptions([a15, a16])], [c21, c30])).
% 153.32/26.11
% 153.32/26.11 cnf(c33, plain,
% 153.32/26.11 $false,
% 153.32/26.11 inference(constraint_solving, [
% 153.32/26.11 bind(X0, divide(a,c)),
% 153.32/26.11 bind(X1, divide(b,c)),
% 153.32/26.11 bind(X2, divide(X0,X1)),
% 153.32/26.11 bind(X3, zero),
% 153.32/26.11 bind(X4, zero),
% 153.32/26.11 bind(X5, divide(X0,X1)),
% 153.32/26.11 bind(X6, a),
% 153.32/26.11 bind(X7, c),
% 153.32/26.11 bind(X8, b),
% 153.32/26.11 bind(X9, divide(X0,X1)),
% 153.32/26.11 bind(X10, zero),
% 153.32/26.11 bind(X11, a),
% 153.32/26.11 bind(X12, b),
% 153.32/26.11 bind(X13, zero),
% 153.32/26.11 bind(X14, c),
% 153.32/26.11 bind(X15, zero)
% 153.32/26.11 ],
% 153.32/26.11 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16])).
% 153.32/26.11
% 153.32/26.11 % SZS output end IncompleteProof
%------------------------------------------------------------------------------