TSTP Solution File: GRP045-2 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : GRP045-2 : 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 : 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 10:08:45 EDT 2022
% Result : Unsatisfiable 0.16s 0.32s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : GRP045-2 : TPTP v8.1.0. Released v1.0.0.
% 0.00/0.11 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.09/0.30 % Computer : n032.cluster.edu
% 0.09/0.30 % Model : x86_64 x86_64
% 0.09/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30 % Memory : 8042.1875MB
% 0.09/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30 % CPULimit : 300
% 0.09/0.30 % WCLimit : 600
% 0.09/0.30 % DateTime : Tue Jun 14 08:54:57 EDT 2022
% 0.09/0.30 % CPUTime :
% 0.16/0.32 % SZS status Unsatisfiable
% 0.16/0.32 % SZS output begin IncompleteProof
% 0.16/0.32 cnf(c0, axiom,
% 0.16/0.32 ~product(c,b,result)).
% 0.16/0.32 cnf(c1, plain,
% 0.16/0.32 ~product(c,b,result),
% 0.16/0.32 inference(start, [], [c0])).
% 0.16/0.32
% 0.16/0.32 cnf(c2, axiom,
% 0.16/0.32 product(X0,X1,X2) | ~product(X3,X4,X2) | ~product(X5,X4,X1) | ~product(X0,X5,X3)).
% 0.16/0.32 cnf(a0, assumption,
% 0.16/0.32 c = X0).
% 0.16/0.32 cnf(a1, assumption,
% 0.16/0.32 b = X1).
% 0.16/0.32 cnf(a2, assumption,
% 0.16/0.32 result = X2).
% 0.16/0.32 cnf(c3, plain,
% 0.16/0.32 $false,
% 0.16/0.32 inference(strict_predicate_extension, [assumptions([a0, a1, a2])], [c1, c2])).
% 0.16/0.32 cnf(c4, plain,
% 0.16/0.32 ~product(X3,X4,X2) | ~product(X5,X4,X1) | ~product(X0,X5,X3),
% 0.16/0.32 inference(strict_predicate_extension, [assumptions([a0, a1, a2])], [c1, c2])).
% 0.16/0.32
% 0.16/0.32 cnf(c5, axiom,
% 0.16/0.32 product(X6,X7,X8) | ~product(X9,X10,X8) | ~product(X11,X7,X10) | ~product(X9,X11,X6)).
% 0.16/0.32 cnf(a3, assumption,
% 0.16/0.32 X3 = X6).
% 0.16/0.32 cnf(a4, assumption,
% 0.16/0.32 X4 = X7).
% 0.16/0.32 cnf(a5, assumption,
% 0.16/0.32 X2 = X8).
% 0.16/0.32 cnf(c6, plain,
% 0.16/0.32 ~product(X5,X4,X1) | ~product(X0,X5,X3),
% 0.16/0.32 inference(strict_predicate_extension, [assumptions([a3, a4, a5])], [c4, c5])).
% 0.16/0.32 cnf(c7, plain,
% 0.16/0.32 ~product(X9,X10,X8) | ~product(X11,X7,X10) | ~product(X9,X11,X6),
% 0.16/0.32 inference(strict_predicate_extension, [assumptions([a3, a4, a5])], [c4, c5])).
% 0.16/0.32
% 0.16/0.32 cnf(c8, axiom,
% 0.16/0.32 product(c,a,result)).
% 0.16/0.32 cnf(a6, assumption,
% 0.16/0.32 X9 = c).
% 0.16/0.32 cnf(a7, assumption,
% 0.16/0.32 X10 = a).
% 0.16/0.32 cnf(a8, assumption,
% 0.16/0.32 X8 = result).
% 0.16/0.32 cnf(c9, plain,
% 0.16/0.32 ~product(X11,X7,X10) | ~product(X9,X11,X6),
% 0.16/0.32 inference(strict_predicate_extension, [assumptions([a6, a7, a8])], [c7, c8])).
% 0.16/0.32 cnf(c10, plain,
% 0.16/0.32 $false,
% 0.16/0.32 inference(strict_predicate_extension, [assumptions([a6, a7, a8])], [c7, c8])).
% 0.16/0.32
% 0.16/0.32 cnf(c11, axiom,
% 0.16/0.32 product(identity,X12,X12)).
% 0.16/0.32 cnf(a9, assumption,
% 0.16/0.32 X11 = identity).
% 0.16/0.32 cnf(a10, assumption,
% 0.16/0.32 X7 = X12).
% 0.16/0.32 cnf(a11, assumption,
% 0.16/0.32 X10 = X12).
% 0.16/0.32 cnf(c12, plain,
% 0.16/0.32 ~product(X9,X11,X6),
% 0.16/0.32 inference(strict_predicate_extension, [assumptions([a9, a10, a11])], [c9, c11])).
% 0.16/0.32 cnf(c13, plain,
% 0.16/0.32 $false,
% 0.16/0.32 inference(strict_predicate_extension, [assumptions([a9, a10, a11])], [c9, c11])).
% 0.16/0.32
% 0.16/0.32 cnf(c14, axiom,
% 0.16/0.32 product(X13,X14,multiply(X13,X14))).
% 0.16/0.32 cnf(a12, assumption,
% 0.16/0.32 X9 = X13).
% 0.16/0.32 cnf(a13, assumption,
% 0.16/0.32 X11 = X14).
% 0.16/0.32 cnf(a14, assumption,
% 0.16/0.32 X6 = multiply(X13,X14)).
% 0.16/0.32 cnf(c15, plain,
% 0.16/0.32 $false,
% 0.16/0.32 inference(strict_predicate_extension, [assumptions([a12, a13, a14])], [c12, c14])).
% 0.16/0.32 cnf(c16, plain,
% 0.16/0.32 $false,
% 0.16/0.32 inference(strict_predicate_extension, [assumptions([a12, a13, a14])], [c12, c14])).
% 0.16/0.32
% 0.16/0.32 cnf(c17, axiom,
% 0.16/0.32 product(X15,X16,X17) | ~product(X15,X16,X18) | ~equalish(X18,X17)).
% 0.16/0.32 cnf(a15, assumption,
% 0.16/0.32 X5 = X15).
% 0.16/0.32 cnf(a16, assumption,
% 0.16/0.32 X4 = X16).
% 0.16/0.32 cnf(a17, assumption,
% 0.16/0.32 X1 = X17).
% 0.16/0.32 cnf(c18, plain,
% 0.16/0.32 ~product(X0,X5,X3),
% 0.16/0.32 inference(strict_predicate_extension, [assumptions([a15, a16, a17])], [c6, c17])).
% 0.16/0.32 cnf(c19, plain,
% 0.16/0.32 ~product(X15,X16,X18) | ~equalish(X18,X17),
% 0.16/0.32 inference(strict_predicate_extension, [assumptions([a15, a16, a17])], [c6, c17])).
% 0.16/0.32
% 0.16/0.32 cnf(c20, plain,
% 0.16/0.32 product(X11,X7,X10)).
% 0.16/0.32 cnf(a18, assumption,
% 0.16/0.32 X15 = X11).
% 0.16/0.32 cnf(a19, assumption,
% 0.16/0.32 X16 = X7).
% 0.16/0.32 cnf(a20, assumption,
% 0.16/0.32 X18 = X10).
% 0.16/0.32 cnf(c21, plain,
% 0.16/0.32 ~equalish(X18,X17),
% 0.16/0.32 inference(predicate_reduction, [assumptions([a18, a19, a20])], [c19, c20])).
% 0.16/0.32
% 0.16/0.32 cnf(c22, axiom,
% 0.16/0.32 equalish(a,b)).
% 0.16/0.32 cnf(a21, assumption,
% 0.16/0.32 X18 = a).
% 0.16/0.32 cnf(a22, assumption,
% 0.16/0.32 X17 = b).
% 0.16/0.32 cnf(c23, plain,
% 0.16/0.32 $false,
% 0.16/0.32 inference(strict_predicate_extension, [assumptions([a21, a22])], [c21, c22])).
% 0.16/0.32 cnf(c24, plain,
% 0.16/0.32 $false,
% 0.16/0.32 inference(strict_predicate_extension, [assumptions([a21, a22])], [c21, c22])).
% 0.16/0.32
% 0.16/0.32 cnf(c25, plain,
% 0.16/0.32 product(X9,X11,X6)).
% 0.16/0.32 cnf(a23, assumption,
% 0.16/0.32 X0 = X9).
% 0.16/0.32 cnf(a24, assumption,
% 0.16/0.32 X5 = X11).
% 0.16/0.32 cnf(a25, assumption,
% 0.16/0.32 X3 = X6).
% 0.16/0.32 cnf(c26, plain,
% 0.16/0.32 $false,
% 0.16/0.32 inference(predicate_reduction, [assumptions([a23, a24, a25])], [c18, c25])).
% 0.16/0.32
% 0.16/0.32 cnf(c27, plain,
% 0.16/0.32 $false,
% 0.16/0.32 inference(constraint_solving, [
% 0.16/0.32 bind(X0, c),
% 0.16/0.32 bind(X1, b),
% 0.16/0.32 bind(X2, result),
% 0.16/0.32 bind(X3, multiply(X13,X14)),
% 0.16/0.32 bind(X4, a),
% 0.16/0.32 bind(X5, identity),
% 0.16/0.32 bind(X6, multiply(X13,X14)),
% 0.16/0.32 bind(X7, a),
% 0.16/0.32 bind(X8, result),
% 0.16/0.32 bind(X9, c),
% 0.16/0.32 bind(X10, a),
% 0.16/0.32 bind(X11, identity),
% 0.16/0.32 bind(X12, a),
% 0.16/0.32 bind(X13, c),
% 0.16/0.32 bind(X14, identity),
% 0.16/0.32 bind(X15, identity),
% 0.16/0.32 bind(X16, a),
% 0.16/0.32 bind(X17, b),
% 0.16/0.32 bind(X18, a)
% 0.16/0.32 ],
% 0.16/0.32 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17, a18, a19, a20, a21, a22, a23, a24, a25])).
% 0.16/0.32
% 0.16/0.32 % SZS output end IncompleteProof
%------------------------------------------------------------------------------