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