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