TSTP Solution File: FLD010-1 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : FLD010-1 : TPTP v8.1.0. Bugfixed v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% Computer : n032.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:15:45 EDT 2022
% Result : Unsatisfiable 0.14s 0.32s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : FLD010-1 : TPTP v8.1.0. Bugfixed v2.7.0.
% 0.00/0.09 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.10/0.28 % Computer : n032.cluster.edu
% 0.10/0.28 % Model : x86_64 x86_64
% 0.10/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.28 % Memory : 8042.1875MB
% 0.10/0.28 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.28 % CPULimit : 300
% 0.10/0.28 % WCLimit : 600
% 0.10/0.28 % DateTime : Tue Jun 7 00:26:50 EDT 2022
% 0.10/0.28 % CPUTime :
% 0.14/0.32 % SZS status Unsatisfiable
% 0.14/0.32 % SZS output begin IncompleteProof
% 0.14/0.32 cnf(c0, axiom,
% 0.14/0.32 ~equalish(multiplicative_inverse(multiplicative_identity),multiplicative_identity)).
% 0.14/0.32 cnf(c1, plain,
% 0.14/0.32 ~equalish(multiplicative_inverse(multiplicative_identity),multiplicative_identity),
% 0.14/0.32 inference(start, [], [c0])).
% 0.14/0.32
% 0.14/0.32 cnf(c2, axiom,
% 0.14/0.32 ~equalish(X0,X1) | ~equalish(X2,X0) | equalish(X2,X1)).
% 0.14/0.32 cnf(a0, assumption,
% 0.14/0.32 multiplicative_inverse(multiplicative_identity) = X2).
% 0.14/0.32 cnf(a1, assumption,
% 0.14/0.32 multiplicative_identity = X1).
% 0.14/0.32 cnf(c3, plain,
% 0.14/0.32 $false,
% 0.14/0.32 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.14/0.32 cnf(c4, plain,
% 0.14/0.32 ~equalish(X0,X1) | ~equalish(X2,X0),
% 0.14/0.32 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.14/0.32
% 0.14/0.32 cnf(c5, axiom,
% 0.14/0.32 equalish(X3,additive_identity) | ~defined(X3) | equalish(multiply(X3,multiplicative_inverse(X3)),multiplicative_identity)).
% 0.14/0.32 cnf(a2, assumption,
% 0.14/0.32 X0 = multiply(X3,multiplicative_inverse(X3))).
% 0.14/0.32 cnf(a3, assumption,
% 0.14/0.32 X1 = multiplicative_identity).
% 0.14/0.32 cnf(c6, plain,
% 0.14/0.32 ~equalish(X2,X0),
% 0.14/0.32 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 0.14/0.32 cnf(c7, plain,
% 0.14/0.32 equalish(X3,additive_identity) | ~defined(X3),
% 0.14/0.32 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 0.14/0.32
% 0.14/0.32 cnf(c8, axiom,
% 0.14/0.32 ~equalish(X4,X5) | equalish(X5,X4)).
% 0.14/0.32 cnf(a4, assumption,
% 0.14/0.32 X3 = X4).
% 0.14/0.32 cnf(a5, assumption,
% 0.14/0.32 additive_identity = X5).
% 0.14/0.32 cnf(c9, plain,
% 0.14/0.32 ~defined(X3),
% 0.14/0.32 inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])).
% 0.14/0.32 cnf(c10, plain,
% 0.14/0.32 equalish(X5,X4),
% 0.14/0.32 inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])).
% 0.14/0.32
% 0.14/0.32 cnf(c11, axiom,
% 0.14/0.32 ~equalish(additive_identity,multiplicative_identity)).
% 0.14/0.32 cnf(a6, assumption,
% 0.14/0.32 X5 = additive_identity).
% 0.14/0.32 cnf(a7, assumption,
% 0.14/0.32 X4 = multiplicative_identity).
% 0.14/0.32 cnf(c12, plain,
% 0.14/0.32 $false,
% 0.14/0.32 inference(strict_predicate_extension, [assumptions([a6, a7])], [c10, c11])).
% 0.14/0.32 cnf(c13, plain,
% 0.14/0.32 $false,
% 0.14/0.32 inference(strict_predicate_extension, [assumptions([a6, a7])], [c10, c11])).
% 0.14/0.32
% 0.14/0.32 cnf(c14, axiom,
% 0.14/0.32 defined(multiplicative_identity)).
% 0.14/0.32 cnf(a8, assumption,
% 0.14/0.32 X3 = multiplicative_identity).
% 0.14/0.32 cnf(c15, plain,
% 0.14/0.32 $false,
% 0.14/0.32 inference(strict_predicate_extension, [assumptions([a8])], [c9, c14])).
% 0.14/0.32 cnf(c16, plain,
% 0.14/0.32 $false,
% 0.14/0.32 inference(strict_predicate_extension, [assumptions([a8])], [c9, c14])).
% 0.14/0.32
% 0.14/0.32 cnf(c17, axiom,
% 0.14/0.32 ~equalish(X6,X7) | equalish(X7,X6)).
% 0.14/0.32 cnf(a9, assumption,
% 0.14/0.32 X2 = X7).
% 0.14/0.32 cnf(a10, assumption,
% 0.14/0.32 X0 = X6).
% 0.14/0.32 cnf(c18, plain,
% 0.14/0.32 $false,
% 0.14/0.32 inference(strict_predicate_extension, [assumptions([a9, a10])], [c6, c17])).
% 0.14/0.32 cnf(c19, plain,
% 0.14/0.32 ~equalish(X6,X7),
% 0.14/0.32 inference(strict_predicate_extension, [assumptions([a9, a10])], [c6, c17])).
% 0.14/0.32
% 0.14/0.32 cnf(c20, axiom,
% 0.14/0.32 ~defined(X8) | equalish(multiply(multiplicative_identity,X8),X8)).
% 0.14/0.32 cnf(a11, assumption,
% 0.14/0.32 X6 = multiply(multiplicative_identity,X8)).
% 0.14/0.32 cnf(a12, assumption,
% 0.14/0.32 X7 = X8).
% 0.14/0.32 cnf(c21, plain,
% 0.14/0.32 $false,
% 0.14/0.32 inference(strict_predicate_extension, [assumptions([a11, a12])], [c19, c20])).
% 0.14/0.32 cnf(c22, plain,
% 0.14/0.32 ~defined(X8),
% 0.14/0.32 inference(strict_predicate_extension, [assumptions([a11, a12])], [c19, c20])).
% 0.14/0.32
% 0.14/0.32 cnf(c23, axiom,
% 0.14/0.32 equalish(X9,additive_identity) | ~defined(X9) | defined(multiplicative_inverse(X9))).
% 0.14/0.32 cnf(a13, assumption,
% 0.14/0.32 X8 = multiplicative_inverse(X9)).
% 0.14/0.32 cnf(c24, plain,
% 0.14/0.32 $false,
% 0.14/0.32 inference(strict_predicate_extension, [assumptions([a13])], [c22, c23])).
% 0.14/0.32 cnf(c25, plain,
% 0.14/0.32 equalish(X9,additive_identity) | ~defined(X9),
% 0.14/0.32 inference(strict_predicate_extension, [assumptions([a13])], [c22, c23])).
% 0.14/0.32
% 0.14/0.32 cnf(c26, plain,
% 0.14/0.32 ~equalish(X3,additive_identity)).
% 0.14/0.32 cnf(a14, assumption,
% 0.14/0.32 X9 = X3).
% 0.14/0.32 cnf(a15, assumption,
% 0.14/0.32 additive_identity = additive_identity).
% 0.14/0.32 cnf(c27, plain,
% 0.14/0.32 ~defined(X9),
% 0.14/0.32 inference(predicate_reduction, [assumptions([a14, a15])], [c25, c26])).
% 0.14/0.32
% 0.14/0.32 cnf(c28, plain,
% 0.14/0.32 defined(X3)).
% 0.14/0.32 cnf(a16, assumption,
% 0.14/0.32 X9 = X3).
% 0.14/0.32 cnf(c29, plain,
% 0.14/0.32 $false,
% 0.14/0.32 inference(predicate_reduction, [assumptions([a16])], [c27, c28])).
% 0.14/0.32
% 0.14/0.32 cnf(c30, plain,
% 0.14/0.32 $false,
% 0.14/0.32 inference(constraint_solving, [
% 0.14/0.32 bind(X0, multiply(X3,multiplicative_inverse(X3))),
% 0.14/0.32 bind(X1, multiplicative_identity),
% 0.14/0.32 bind(X2, multiplicative_inverse(multiplicative_identity)),
% 0.14/0.32 bind(X3, multiplicative_identity),
% 0.14/0.32 bind(X4, multiplicative_identity),
% 0.14/0.32 bind(X5, additive_identity),
% 0.14/0.32 bind(X6, multiply(X3,multiplicative_inverse(X3))),
% 0.14/0.32 bind(X7, multiplicative_inverse(multiplicative_identity)),
% 0.14/0.32 bind(X8, multiplicative_inverse(X3)),
% 0.14/0.32 bind(X9, multiplicative_identity)
% 0.14/0.32 ],
% 0.14/0.32 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16])).
% 0.14/0.32
% 0.14/0.32 % SZS output end IncompleteProof
%------------------------------------------------------------------------------