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