TSTP Solution File: GRP034-3 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : GRP034-3 : 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 : n005.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:41 EDT 2022
% Result : Unsatisfiable 0.13s 0.35s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : GRP034-3 : TPTP v8.1.0. Released v1.0.0.
% 0.11/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.13/0.34 % Computer : n005.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Tue Jun 14 01:32:39 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.13/0.35 % SZS status Unsatisfiable
% 0.13/0.35 % SZS output begin IncompleteProof
% 0.13/0.35 cnf(c0, axiom,
% 0.13/0.35 ~subgroup_member(inverse(a))).
% 0.13/0.35 cnf(c1, plain,
% 0.13/0.35 ~subgroup_member(inverse(a)),
% 0.13/0.35 inference(start, [], [c0])).
% 0.13/0.35
% 0.13/0.35 cnf(c2, axiom,
% 0.13/0.35 subgroup_member(X0) | ~product(X1,inverse(X2),X0) | ~subgroup_member(X2) | ~subgroup_member(X1)).
% 0.13/0.35 cnf(a0, assumption,
% 0.13/0.35 inverse(a) = X0).
% 0.13/0.35 cnf(c3, plain,
% 0.13/0.35 $false,
% 0.13/0.35 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 0.13/0.35 cnf(c4, plain,
% 0.13/0.35 ~product(X1,inverse(X2),X0) | ~subgroup_member(X2) | ~subgroup_member(X1),
% 0.13/0.35 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 0.13/0.35
% 0.13/0.35 cnf(c5, axiom,
% 0.13/0.35 product(identity,X3,X3)).
% 0.13/0.35 cnf(a1, assumption,
% 0.13/0.35 X1 = identity).
% 0.13/0.35 cnf(a2, assumption,
% 0.13/0.35 inverse(X2) = X3).
% 0.13/0.35 cnf(a3, assumption,
% 0.13/0.35 X0 = X3).
% 0.13/0.35 cnf(c6, plain,
% 0.13/0.35 ~subgroup_member(X2) | ~subgroup_member(X1),
% 0.13/0.35 inference(strict_predicate_extension, [assumptions([a1, a2, a3])], [c4, c5])).
% 0.13/0.35 cnf(c7, plain,
% 0.13/0.35 $false,
% 0.13/0.35 inference(strict_predicate_extension, [assumptions([a1, a2, a3])], [c4, c5])).
% 0.13/0.35
% 0.13/0.35 cnf(c8, axiom,
% 0.13/0.35 subgroup_member(a)).
% 0.13/0.35 cnf(a4, assumption,
% 0.13/0.35 X2 = a).
% 0.13/0.35 cnf(c9, plain,
% 0.13/0.35 ~subgroup_member(X1),
% 0.13/0.35 inference(strict_predicate_extension, [assumptions([a4])], [c6, c8])).
% 0.13/0.35 cnf(c10, plain,
% 0.13/0.35 $false,
% 0.13/0.35 inference(strict_predicate_extension, [assumptions([a4])], [c6, c8])).
% 0.13/0.35
% 0.13/0.35 cnf(c11, axiom,
% 0.13/0.35 subgroup_member(X4) | ~product(X5,inverse(X6),X4) | ~subgroup_member(X6) | ~subgroup_member(X5)).
% 0.13/0.35 cnf(a5, assumption,
% 0.13/0.35 X1 = X4).
% 0.13/0.35 cnf(c12, plain,
% 0.13/0.35 $false,
% 0.13/0.35 inference(strict_predicate_extension, [assumptions([a5])], [c9, c11])).
% 0.13/0.35 cnf(c13, plain,
% 0.13/0.35 ~product(X5,inverse(X6),X4) | ~subgroup_member(X6) | ~subgroup_member(X5),
% 0.13/0.35 inference(strict_predicate_extension, [assumptions([a5])], [c9, c11])).
% 0.13/0.35
% 0.13/0.35 cnf(c14, axiom,
% 0.13/0.35 product(X7,inverse(X7),identity)).
% 0.13/0.35 cnf(a6, assumption,
% 0.13/0.35 X5 = X7).
% 0.13/0.35 cnf(a7, assumption,
% 0.13/0.35 inverse(X6) = inverse(X7)).
% 0.13/0.35 cnf(a8, assumption,
% 0.13/0.35 X4 = identity).
% 0.13/0.35 cnf(c15, plain,
% 0.13/0.35 ~subgroup_member(X6) | ~subgroup_member(X5),
% 0.13/0.35 inference(strict_predicate_extension, [assumptions([a6, a7, a8])], [c13, c14])).
% 0.13/0.35 cnf(c16, plain,
% 0.13/0.35 $false,
% 0.13/0.35 inference(strict_predicate_extension, [assumptions([a6, a7, a8])], [c13, c14])).
% 0.13/0.35
% 0.13/0.35 cnf(c17, plain,
% 0.13/0.35 subgroup_member(X2)).
% 0.13/0.35 cnf(a9, assumption,
% 0.13/0.35 X6 = X2).
% 0.13/0.35 cnf(c18, plain,
% 0.13/0.35 ~subgroup_member(X5),
% 0.13/0.35 inference(predicate_reduction, [assumptions([a9])], [c15, c17])).
% 0.13/0.35
% 0.13/0.35 cnf(c19, plain,
% 0.13/0.35 subgroup_member(X2)).
% 0.13/0.35 cnf(a10, assumption,
% 0.13/0.35 X5 = X2).
% 0.13/0.35 cnf(c20, plain,
% 0.13/0.35 $false,
% 0.13/0.35 inference(predicate_reduction, [assumptions([a10])], [c18, c19])).
% 0.13/0.35
% 0.13/0.35 cnf(c21, plain,
% 0.13/0.35 $false,
% 0.13/0.35 inference(constraint_solving, [
% 0.13/0.35 bind(X0, inverse(a)),
% 0.13/0.35 bind(X1, identity),
% 0.13/0.35 bind(X2, a),
% 0.13/0.35 bind(X3, inverse(X2)),
% 0.13/0.35 bind(X4, identity),
% 0.13/0.35 bind(X5, a),
% 0.13/0.35 bind(X6, a),
% 0.13/0.35 bind(X7, a)
% 0.13/0.35 ],
% 0.13/0.35 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10])).
% 0.13/0.35
% 0.13/0.35 % SZS output end IncompleteProof
%------------------------------------------------------------------------------