TSTP Solution File: HEN003-4 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : HEN003-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 : n004.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:36 EDT 2022
% Result : Unsatisfiable 5.63s 1.13s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : HEN003-4 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.12 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.12/0.34 % Computer : n004.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 1 13:00:08 EDT 2022
% 0.12/0.34 % CPUTime :
% 5.63/1.13 % SZS status Unsatisfiable
% 5.63/1.13 % SZS output begin IncompleteProof
% 5.63/1.13 cnf(c0, axiom,
% 5.63/1.13 zero != divide(a,a)).
% 5.63/1.13 cnf(c1, plain,
% 5.63/1.13 zero != divide(a,a),
% 5.63/1.13 inference(start, [], [c0])).
% 5.63/1.13
% 5.63/1.13 cnf(c2, axiom,
% 5.63/1.13 X0 = X1 | ~less_equal(X1,X0) | ~less_equal(X0,X1)).
% 5.63/1.13 cnf(a0, assumption,
% 5.63/1.13 divide(a,a) = X1).
% 5.63/1.13 cnf(c3, plain,
% 5.63/1.13 $false,
% 5.63/1.13 inference(variable_extension, [assumptions([a0])], [c1, c2])).
% 5.63/1.13 cnf(c4, plain,
% 5.63/1.13 ~less_equal(X1,X0) | ~less_equal(X0,X1),
% 5.63/1.13 inference(variable_extension, [assumptions([a0])], [c1, c2])).
% 5.63/1.13 cnf(c5, plain,
% 5.63/1.13 X0 != X2 | zero != X2,
% 5.63/1.13 inference(variable_extension, [assumptions([a0])], [c1, c2])).
% 5.63/1.13
% 5.63/1.13 cnf(a1, assumption,
% 5.63/1.13 X0 = X2).
% 5.63/1.13 cnf(c6, plain,
% 5.63/1.13 zero != X2,
% 5.63/1.13 inference(reflexivity, [assumptions([a1])], [c5])).
% 5.63/1.13
% 5.63/1.13 cnf(a2, assumption,
% 5.63/1.13 zero = X2).
% 5.63/1.13 cnf(c7, plain,
% 5.63/1.13 $false,
% 5.63/1.13 inference(reflexivity, [assumptions([a2])], [c6])).
% 5.63/1.13
% 5.63/1.13 cnf(c8, axiom,
% 5.63/1.13 less_equal(X3,X4) | divide(X3,X4) != zero).
% 5.63/1.13 cnf(a3, assumption,
% 5.63/1.13 X1 = X3).
% 5.63/1.13 cnf(a4, assumption,
% 5.63/1.13 X0 = X4).
% 5.63/1.13 cnf(c9, plain,
% 5.63/1.13 ~less_equal(X0,X1),
% 5.63/1.13 inference(strict_predicate_extension, [assumptions([a3, a4])], [c4, c8])).
% 5.63/1.13 cnf(c10, plain,
% 5.63/1.13 divide(X3,X4) != zero,
% 5.63/1.13 inference(strict_predicate_extension, [assumptions([a3, a4])], [c4, c8])).
% 5.63/1.13
% 5.63/1.13 cnf(c11, axiom,
% 5.63/1.13 X5 = X6 | ~less_equal(X6,X5) | ~less_equal(X5,X6)).
% 5.63/1.13 cnf(a5, assumption,
% 5.63/1.13 divide(X3,X4) = X6).
% 5.63/1.13 cnf(c12, plain,
% 5.63/1.13 $false,
% 5.63/1.13 inference(variable_extension, [assumptions([a5])], [c10, c11])).
% 5.63/1.13 cnf(c13, plain,
% 5.63/1.13 ~less_equal(X6,X5) | ~less_equal(X5,X6),
% 5.63/1.13 inference(variable_extension, [assumptions([a5])], [c10, c11])).
% 5.63/1.13 cnf(c14, plain,
% 5.63/1.13 X5 != X7 | X7 != zero,
% 5.63/1.13 inference(variable_extension, [assumptions([a5])], [c10, c11])).
% 5.63/1.13
% 5.63/1.13 cnf(a6, assumption,
% 5.63/1.13 X5 = X7).
% 5.63/1.13 cnf(c15, plain,
% 5.63/1.13 X7 != zero,
% 5.63/1.13 inference(reflexivity, [assumptions([a6])], [c14])).
% 5.63/1.13
% 5.63/1.13 cnf(a7, assumption,
% 5.63/1.13 X7 = zero).
% 5.63/1.13 cnf(c16, plain,
% 5.63/1.13 $false,
% 5.63/1.13 inference(reflexivity, [assumptions([a7])], [c15])).
% 5.63/1.13
% 5.63/1.13 cnf(c17, axiom,
% 5.63/1.13 less_equal(divide(divide(X8,X9),divide(X10,X9)),divide(divide(X8,X10),X9))).
% 5.63/1.13 cnf(a8, assumption,
% 5.63/1.13 X11 = X6).
% 5.63/1.13 cnf(a9, assumption,
% 5.63/1.13 X12 = X5).
% 5.63/1.13 cnf(c18, plain,
% 5.63/1.13 ~less_equal(X5,X6),
% 5.63/1.13 inference(lazy_predicate_extension, [assumptions([a8, a9])], [c13, c17])).
% 5.63/1.13 cnf(c19, plain,
% 5.63/1.13 $false,
% 5.63/1.13 inference(lazy_predicate_extension, [assumptions([a8, a9])], [c13, c17])).
% 5.63/1.13 cnf(c20, plain,
% 5.63/1.13 divide(divide(X8,X9),divide(X10,X9)) != X11 | divide(divide(X8,X10),X9) != X12,
% 5.63/1.13 inference(lazy_predicate_extension, [assumptions([a8, a9])], [c13, c17])).
% 5.63/1.13
% 5.63/1.13 cnf(c21, axiom,
% 5.63/1.13 zero = divide(zero,X13)).
% 5.63/1.13 cnf(a10, assumption,
% 5.63/1.13 divide(X10,X9) = divide(zero,X13)).
% 5.63/1.13 cnf(c22, plain,
% 5.63/1.13 divide(divide(X8,X10),X9) != X12,
% 5.63/1.13 inference(strict_function_extension, [assumptions([a10])], [c20, c21])).
% 5.63/1.13 cnf(c23, plain,
% 5.63/1.13 $false,
% 5.63/1.13 inference(strict_function_extension, [assumptions([a10])], [c20, c21])).
% 5.63/1.13 cnf(c24, plain,
% 5.63/1.13 X14 != zero | divide(divide(X8,X9),X14) != X11,
% 5.63/1.13 inference(strict_function_extension, [assumptions([a10])], [c20, c21])).
% 5.63/1.13
% 5.63/1.13 cnf(a11, assumption,
% 5.63/1.13 X14 = zero).
% 5.63/1.13 cnf(c25, plain,
% 5.63/1.13 divide(divide(X8,X9),X14) != X11,
% 5.63/1.13 inference(reflexivity, [assumptions([a11])], [c24])).
% 5.63/1.13
% 5.63/1.13 cnf(a12, assumption,
% 5.63/1.13 divide(divide(X8,X9),X14) = X11).
% 5.63/1.13 cnf(c26, plain,
% 5.63/1.13 $false,
% 5.63/1.13 inference(reflexivity, [assumptions([a12])], [c25])).
% 5.63/1.13
% 5.63/1.13 cnf(c27, axiom,
% 5.63/1.13 divide(X15,X16) = zero | ~less_equal(X15,X16)).
% 5.63/1.13 cnf(a13, assumption,
% 5.63/1.13 divide(divide(X8,X10),X9) = divide(X15,X16)).
% 5.63/1.13 cnf(c28, plain,
% 5.63/1.13 $false,
% 5.63/1.13 inference(strict_function_extension, [assumptions([a13])], [c22, c27])).
% 5.63/1.13 cnf(c29, plain,
% 5.63/1.13 ~less_equal(X15,X16),
% 5.63/1.13 inference(strict_function_extension, [assumptions([a13])], [c22, c27])).
% 5.63/1.13 cnf(c30, plain,
% 5.63/1.13 X17 != zero | X17 != X12,
% 5.63/1.13 inference(strict_function_extension, [assumptions([a13])], [c22, c27])).
% 5.63/1.13
% 5.63/1.13 cnf(a14, assumption,
% 5.63/1.13 X17 = zero).
% 5.63/1.13 cnf(c31, plain,
% 5.63/1.13 X17 != X12,
% 5.63/1.13 inference(reflexivity, [assumptions([a14])], [c30])).
% 5.63/1.13
% 5.63/1.13 cnf(a15, assumption,
% 5.63/1.13 X17 = X12).
% 5.63/1.13 cnf(c32, plain,
% 5.63/1.13 $false,
% 5.63/1.13 inference(reflexivity, [assumptions([a15])], [c31])).
% 5.63/1.13
% 5.63/1.13 cnf(c33, axiom,
% 5.63/1.13 less_equal(divide(X18,X19),X18)).
% 5.63/1.13 cnf(a16, assumption,
% 5.63/1.13 X15 = divide(X18,X19)).
% 5.63/1.13 cnf(a17, assumption,
% 5.63/1.13 X16 = X18).
% 5.63/1.13 cnf(c34, plain,
% 5.63/1.13 $false,
% 5.63/1.13 inference(strict_predicate_extension, [assumptions([a16, a17])], [c29, c33])).
% 5.63/1.13 cnf(c35, plain,
% 5.63/1.13 $false,
% 5.63/1.13 inference(strict_predicate_extension, [assumptions([a16, a17])], [c29, c33])).
% 5.63/1.13
% 5.63/1.13 cnf(c36, axiom,
% 5.63/1.13 less_equal(zero,X20)).
% 5.63/1.13 cnf(a18, assumption,
% 5.63/1.13 X5 = zero).
% 5.63/1.13 cnf(a19, assumption,
% 5.63/1.13 X6 = X20).
% 5.63/1.13 cnf(c37, plain,
% 5.63/1.13 $false,
% 5.63/1.13 inference(strict_predicate_extension, [assumptions([a18, a19])], [c18, c36])).
% 5.63/1.13 cnf(c38, plain,
% 5.63/1.13 $false,
% 5.63/1.13 inference(strict_predicate_extension, [assumptions([a18, a19])], [c18, c36])).
% 5.63/1.13
% 5.63/1.13 cnf(c39, axiom,
% 5.63/1.13 less_equal(zero,X21)).
% 5.63/1.13 cnf(a20, assumption,
% 5.63/1.13 X0 = zero).
% 5.63/1.13 cnf(a21, assumption,
% 5.63/1.13 X1 = X21).
% 5.63/1.13 cnf(c40, plain,
% 5.63/1.13 $false,
% 5.63/1.13 inference(strict_predicate_extension, [assumptions([a20, a21])], [c9, c39])).
% 5.63/1.13 cnf(c41, plain,
% 5.63/1.13 $false,
% 5.63/1.13 inference(strict_predicate_extension, [assumptions([a20, a21])], [c9, c39])).
% 5.63/1.13
% 5.63/1.13 cnf(c42, plain,
% 5.63/1.13 $false,
% 5.63/1.13 inference(constraint_solving, [
% 5.63/1.13 bind(X0, zero),
% 5.63/1.13 bind(X1, divide(a,a)),
% 5.63/1.13 bind(X2, zero),
% 5.63/1.13 bind(X3, divide(a,a)),
% 5.63/1.13 bind(X4, zero),
% 5.63/1.13 bind(X5, zero),
% 5.63/1.13 bind(X6, divide(X3,X4)),
% 5.63/1.13 bind(X7, zero),
% 5.63/1.13 bind(X8, a),
% 5.63/1.13 bind(X9, a),
% 5.63/1.13 bind(X10, zero),
% 5.63/1.13 bind(X11, divide(X3,X4)),
% 5.63/1.13 bind(X12, zero),
% 5.63/1.13 bind(X13, a),
% 5.63/1.13 bind(X14, zero),
% 5.63/1.13 bind(X15, divide(X8,X10)),
% 5.63/1.13 bind(X16, a),
% 5.63/1.13 bind(X17, zero),
% 5.63/1.13 bind(X18, a),
% 5.63/1.13 bind(X19, zero),
% 5.63/1.13 bind(X20, divide(X3,X4)),
% 5.63/1.13 bind(X21, divide(a,a))
% 5.63/1.13 ],
% 5.63/1.13 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17, a18, a19, a20, a21])).
% 5.63/1.13
% 5.63/1.13 % SZS output end IncompleteProof
%------------------------------------------------------------------------------