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