TSTP Solution File: GRP363-1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : GRP363-1 : TPTP v8.1.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n004.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 11:38:00 EDT 2022
% Result : Timeout 291.50s 291.69s
% Output : None
% Verified :
% SZS Type : Refutation
% Derivation depth : 25
% Number of leaves : 22
% Syntax : Number of clauses : 104 ( 21 unt; 77 nHn; 75 RR)
% Number of literals : 224 ( 223 equ; 47 neg)
% Maximal clause size : 10 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 8 con; 0-2 aty)
% Number of variables : 57 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(left_identity,axiom,
multiply(identity,X) = X,
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-0.ax',left_identity) ).
cnf(left_inverse,axiom,
multiply(inverse(X),X) = identity,
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-0.ax',left_inverse) ).
cnf(associativity,axiom,
multiply(multiply(X,Y),Z) = multiply(X,multiply(Y,Z)),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-0.ax',associativity) ).
cnf(prove_this_2,negated_conjecture,
( multiply(sk_c6,sk_c5) = sk_c7
| multiply(sk_c2,sk_c6) = sk_c7 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_2) ).
cnf(prove_this_3,negated_conjecture,
( multiply(sk_c6,sk_c5) = sk_c7
| inverse(sk_c2) = sk_c6 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_3) ).
cnf(prove_this_7,negated_conjecture,
( inverse(sk_c6) = sk_c5
| multiply(sk_c6,sk_c7) = sk_c5 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_7) ).
cnf(prove_this_8,negated_conjecture,
( inverse(sk_c6) = sk_c5
| multiply(sk_c2,sk_c6) = sk_c7 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_8) ).
cnf(prove_this_9,negated_conjecture,
( inverse(sk_c6) = sk_c5
| inverse(sk_c2) = sk_c6 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_9) ).
cnf(prove_this_10,negated_conjecture,
( inverse(sk_c6) = sk_c5
| multiply(sk_c7,sk_c4) = sk_c6 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_10) ).
cnf(prove_this_11,negated_conjecture,
( inverse(sk_c6) = sk_c5
| multiply(sk_c3,sk_c7) = sk_c4 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_11) ).
cnf(prove_this_12,negated_conjecture,
( inverse(sk_c6) = sk_c5
| inverse(sk_c3) = sk_c7 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_12) ).
cnf(prove_this_13,negated_conjecture,
( multiply(sk_c1,sk_c6) = sk_c5
| multiply(sk_c6,sk_c7) = sk_c5 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_13) ).
cnf(prove_this_16,negated_conjecture,
( multiply(sk_c1,sk_c6) = sk_c5
| multiply(sk_c7,sk_c4) = sk_c6 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_16) ).
cnf(prove_this_17,negated_conjecture,
( multiply(sk_c1,sk_c6) = sk_c5
| multiply(sk_c3,sk_c7) = sk_c4 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_17) ).
cnf(prove_this_18,negated_conjecture,
( multiply(sk_c1,sk_c6) = sk_c5
| inverse(sk_c3) = sk_c7 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_18) ).
cnf(prove_this_19,negated_conjecture,
( inverse(sk_c1) = sk_c6
| multiply(sk_c6,sk_c7) = sk_c5 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_19) ).
cnf(prove_this_20,negated_conjecture,
( inverse(sk_c1) = sk_c6
| multiply(sk_c2,sk_c6) = sk_c7 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_20) ).
cnf(prove_this_21,negated_conjecture,
( inverse(sk_c1) = sk_c6
| inverse(sk_c2) = sk_c6 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_21) ).
cnf(prove_this_22,negated_conjecture,
( inverse(sk_c1) = sk_c6
| multiply(sk_c7,sk_c4) = sk_c6 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_22) ).
cnf(prove_this_23,negated_conjecture,
( inverse(sk_c1) = sk_c6
| multiply(sk_c3,sk_c7) = sk_c4 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_23) ).
cnf(prove_this_24,negated_conjecture,
( inverse(sk_c1) = sk_c6
| inverse(sk_c3) = sk_c7 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_24) ).
cnf(prove_this_25,negated_conjecture,
( multiply(sk_c6,sk_c5) != sk_c7
| inverse(sk_c6) != sk_c5
| multiply(X,sk_c6) != sk_c5
| inverse(X) != sk_c6
| multiply(sk_c6,sk_c7) != sk_c5
| multiply(Y,sk_c6) != sk_c7
| inverse(Y) != sk_c6
| multiply(sk_c7,Z) != sk_c6
| multiply(U,sk_c7) != Z
| inverse(U) != sk_c7 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_25) ).
cnf(34,plain,
X = multiply(inverse(Y),multiply(Y,X)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[associativity,left_inverse,theory(equality)]),left_identity,theory(equality)]) ).
cnf(35,plain,
multiply(multiply(X,inverse(Y)),Y) = multiply(X,identity),
inference('PARAMODULATE',[status(thm)],[associativity,left_inverse,theory(equality)]) ).
cnf(83,plain,
( multiply(sk_c6,sk_c5) != sk_c7
| inverse(sk_c6) != sk_c5
| multiply(X,sk_c6) != sk_c5
| inverse(X) != sk_c6
| multiply(sk_c6,sk_c7) != sk_c5
| multiply(Y,sk_c6) != sk_c7
| inverse(Y) != sk_c6
| multiply(sk_c7,Z) != sk_c6
| sk_c7 != Z
| inverse(identity) != sk_c7 ),
inference('PARAMODULATE',[status(thm)],[prove_this_25,left_identity,theory(equality)]) ).
cnf(125,plain,
X = multiply(inverse(inverse(X)),identity),
inference('PARAMODULATE',[status(thm)],[34,left_inverse,theory(equality)]) ).
cnf(126,plain,
multiply(X,Y) = multiply(inverse(inverse(X)),Y),
inference('PARAMODULATE',[status(thm)],[34,34,theory(equality)]) ).
cnf(127,plain,
X = multiply(X,identity),
inference('REWRITE',[status(thm)],[125,126,theory(equality)]) ).
cnf(128,plain,
multiply(multiply(X,inverse(Y)),Y) = X,
inference('REWRITE',[status(thm)],[35,127,theory(equality)]) ).
cnf(130,plain,
( inverse(sk_c6) = sk_c5
| sk_c4 = multiply(inverse(sk_c7),sk_c6) ),
inference('PARAMODULATE',[status(thm)],[34,prove_this_10,theory(equality)]) ).
cnf(133,plain,
( inverse(sk_c1) = sk_c6
| sk_c7 = multiply(inverse(sk_c3),sk_c4) ),
inference('PARAMODULATE',[status(thm)],[34,prove_this_23,theory(equality)]) ).
cnf(134,plain,
( inverse(sk_c6) = sk_c5
| sk_c7 = multiply(inverse(sk_c3),sk_c4) ),
inference('PARAMODULATE',[status(thm)],[34,prove_this_11,theory(equality)]) ).
cnf(136,plain,
( inverse(sk_c2) = sk_c6
| sk_c5 = multiply(inverse(sk_c6),sk_c7) ),
inference('PARAMODULATE',[status(thm)],[34,prove_this_3,theory(equality)]) ).
cnf(137,plain,
( inverse(sk_c1) = sk_c6
| sk_c6 = multiply(inverse(sk_c2),sk_c7) ),
inference('PARAMODULATE',[status(thm)],[34,prove_this_20,theory(equality)]) ).
cnf(139,plain,
( inverse(sk_c3) = sk_c7
| sk_c6 = multiply(inverse(sk_c1),sk_c5) ),
inference('PARAMODULATE',[status(thm)],[34,prove_this_18,theory(equality)]) ).
cnf(141,plain,
multiply(multiply(X,inverse(Y)),multiply(Y,Z)) = multiply(X,Z),
inference('PARAMODULATE',[status(thm)],[associativity,34,theory(equality)]) ).
cnf(150,plain,
( multiply(sk_c1,sk_c6) = sk_c5
| sk_c7 = multiply(inverse(sk_c3),sk_c4) ),
inference('PARAMODULATE',[status(thm)],[34,prove_this_17,theory(equality)]) ).
cnf(155,plain,
inverse(identity) = identity,
inference('PARAMODULATE',[status(thm)],[left_inverse,127,theory(equality)]) ).
cnf(158,plain,
( multiply(sk_c6,sk_c5) != sk_c7
| inverse(sk_c6) != sk_c5
| multiply(X,sk_c6) != sk_c5
| inverse(X) != sk_c6
| multiply(sk_c6,sk_c7) != sk_c5
| multiply(Y,sk_c6) != sk_c7
| inverse(Y) != sk_c6
| multiply(sk_c7,Z) != sk_c6
| sk_c7 != Z
| identity != sk_c7 ),
inference('REWRITE',[status(thm)],[83,155,theory(equality)]) ).
cnf(160,plain,
X = inverse(inverse(X)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[128,left_inverse,theory(equality)]),left_identity,theory(equality)]) ).
cnf(167,plain,
( inverse(sk_c3) = sk_c7
| multiply(multiply(X,sk_c5),sk_c6) = X ),
inference('PARAMODULATE',[status(thm)],[128,prove_this_12,theory(equality)]) ).
cnf(172,plain,
multiply(X,inverse(X)) = identity,
inference('PARAMODULATE',[status(thm)],[left_inverse,160,theory(equality)]) ).
cnf(173,plain,
multiply(multiply(X,Y),inverse(Y)) = X,
inference('PARAMODULATE',[status(thm)],[128,160,theory(equality)]) ).
cnf(174,plain,
X = multiply(Y,multiply(inverse(Y),X)),
inference('PARAMODULATE',[status(thm)],[34,160,theory(equality)]) ).
cnf(188,plain,
inverse(X) = multiply(inverse(multiply(Y,X)),Y),
inference('PARAMODULATE',[status(thm)],[34,173,theory(equality)]) ).
cnf(203,plain,
( multiply(sk_c1,sk_c6) = sk_c5
| multiply(sk_c6,inverse(sk_c4)) = sk_c7 ),
inference('PARAMODULATE',[status(thm)],[173,prove_this_16,theory(equality)]) ).
cnf(250,plain,
( inverse(sk_c1) = sk_c6
| sk_c7 = multiply(sk_c7,sk_c4) ),
inference('PARAMODULATE',[status(thm)],[133,prove_this_24,theory(equality)]) ).
cnf(254,plain,
( inverse(sk_c1) = sk_c6
| sk_c6 = sk_c7 ),
inference('PARAMODULATE',[status(thm)],[prove_this_22,250,theory(equality)]) ).
cnf(260,plain,
( sk_c6 = sk_c7
| multiply(sk_c1,sk_c6) = identity ),
inference('PARAMODULATE',[status(thm)],[172,254,theory(equality)]) ).
cnf(262,plain,
( sk_c6 = sk_c7
| X = multiply(sk_c1,multiply(sk_c6,X)) ),
inference('PARAMODULATE',[status(thm)],[174,254,theory(equality)]) ).
cnf(330,plain,
( inverse(sk_c2) = sk_c6
| sk_c5 = multiply(sk_c5,sk_c7) ),
inference('PARAMODULATE',[status(thm)],[136,prove_this_9,theory(equality)]) ).
cnf(338,plain,
( inverse(sk_c2) = sk_c6
| identity = sk_c7 ),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[34,330,theory(equality)]),left_inverse,theory(equality)]) ).
cnf(343,plain,
( identity = sk_c7
| multiply(sk_c2,sk_c6) = identity ),
inference('PARAMODULATE',[status(thm)],[172,338,theory(equality)]) ).
cnf(360,plain,
( identity = sk_c7
| inverse(sk_c6) = sk_c5 ),
inference('PARAMODULATE',[status(thm)],[prove_this_8,343,theory(equality)]) ).
cnf(374,plain,
( identity = sk_c7
| multiply(sk_c6,sk_c5) = identity ),
inference('PARAMODULATE',[status(thm)],[172,360,theory(equality)]) ).
cnf(401,plain,
( inverse(sk_c1) = sk_c6
| sk_c6 = multiply(sk_c6,sk_c7) ),
inference('PARAMODULATE',[status(thm)],[137,prove_this_21,theory(equality)]) ).
cnf(406,plain,
( inverse(sk_c1) = sk_c6
| sk_c6 = sk_c5 ),
inference('PARAMODULATE',[status(thm)],[prove_this_19,401,theory(equality)]) ).
cnf(412,plain,
( sk_c6 = sk_c5
| multiply(sk_c1,sk_c6) = identity ),
inference('PARAMODULATE',[status(thm)],[172,406,theory(equality)]) ).
cnf(414,plain,
( sk_c6 = sk_c5
| X = multiply(sk_c1,multiply(sk_c6,X)) ),
inference('PARAMODULATE',[status(thm)],[174,406,theory(equality)]) ).
cnf(417,plain,
( sk_c6 = sk_c5
| X = multiply(sk_c6,multiply(sk_c1,X)) ),
inference('PARAMODULATE',[status(thm)],[34,406,theory(equality)]) ).
cnf(450,plain,
multiply(inverse(X),Y) = inverse(multiply(inverse(Y),X)),
inference('PARAMODULATE',[status(thm)],[128,188,theory(equality)]) ).
cnf(456,plain,
( inverse(sk_c6) = sk_c5
| sk_c4 = inverse(multiply(inverse(sk_c6),sk_c7)) ),
inference('REWRITE',[status(thm)],[130,450,theory(equality)]) ).
cnf(721,plain,
( multiply(sk_c1,sk_c6) = sk_c5
| multiply(sk_c7,inverse(sk_c4)) = inverse(sk_c3) ),
inference('PARAMODULATE',[status(thm)],[173,150,theory(equality)]) ).
cnf(760,plain,
( inverse(sk_c3) = sk_c7
| multiply(sk_c6,sk_c6) = inverse(sk_c1) ),
inference('PARAMODULATE',[status(thm)],[167,139,theory(equality)]) ).
cnf(801,plain,
( identity = sk_c7
| multiply(sk_c2,sk_c6) = sk_c7 ),
inference('PARAMODULATE',[status(thm)],[prove_this_2,374,theory(equality)]) ).
cnf(1338,plain,
( inverse(sk_c3) = sk_c7
| sk_c6 = sk_c7
| identity = sk_c6 ),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[262,760,theory(equality)]),172,theory(equality)]) ).
cnf(1678,plain,
( inverse(sk_c6) = sk_c5
| multiply(multiply(X,sk_c4),multiply(inverse(sk_c6),sk_c7)) = X ),
inference('PARAMODULATE',[status(thm)],[128,456,theory(equality)]) ).
cnf(2101,plain,
identity = sk_c7,
inference('PARAMODULATE',[status(thm)],[343,801,theory(equality)]) ).
cnf(2107,plain,
( inverse(sk_c6) = sk_c5
| sk_c6 = sk_c5 ),
inference('REWRITE',[status(thm)],[prove_this_7,127,2101,theory(equality)]) ).
cnf(2112,plain,
( multiply(sk_c1,sk_c6) = sk_c5
| sk_c6 = sk_c5 ),
inference('REWRITE',[status(thm)],[prove_this_13,127,2101,theory(equality)]) ).
cnf(2183,plain,
( inverse(sk_c6) = sk_c5
| identity = multiply(inverse(sk_c3),sk_c4) ),
inference('REWRITE',[status(thm)],[134,2101,theory(equality)]) ).
cnf(2190,plain,
( multiply(sk_c6,sk_c5) != identity
| inverse(sk_c6) != sk_c5
| multiply(X,sk_c6) != sk_c5
| inverse(X) != sk_c6
| sk_c6 != sk_c5
| multiply(Y,sk_c6) != identity
| inverse(Y) != sk_c6
| Z != sk_c6
| identity != Z ),
inference('REWRITE',[status(thm)],[158,left_identity,127,2101,theory(equality)]) ).
cnf(2201,plain,
( multiply(sk_c1,sk_c6) = sk_c5
| multiply(sk_c6,inverse(sk_c4)) = identity ),
inference('REWRITE',[status(thm)],[203,2101,theory(equality)]) ).
cnf(2224,plain,
( identity = sk_c6
| multiply(sk_c1,sk_c6) = identity ),
inference('REWRITE',[status(thm)],[260,2101,theory(equality)]) ).
cnf(2311,plain,
( multiply(sk_c1,sk_c6) = sk_c5
| inverse(sk_c4) = inverse(sk_c3) ),
inference('REWRITE',[status(thm)],[721,left_identity,2101,theory(equality)]) ).
cnf(2489,plain,
( inverse(sk_c3) = identity
| identity = sk_c6 ),
inference('REWRITE',[status(thm)],[1338,2101,theory(equality)]) ).
cnf(2586,plain,
( inverse(sk_c6) = sk_c5
| multiply(multiply(X,sk_c4),inverse(sk_c6)) = X ),
inference('REWRITE',[status(thm)],[1678,left_identity,155,450,2101,theory(equality)]) ).
cnf(2710,plain,
( sk_c6 = sk_c5
| X = multiply(sk_c5,multiply(sk_c6,X)) ),
inference('PARAMODULATE',[status(thm)],[34,2107,theory(equality)]) ).
cnf(2751,plain,
( sk_c6 = sk_c5
| identity = sk_c5 ),
inference('PARAMODULATE',[status(thm)],[412,2112,theory(equality)]) ).
cnf(2753,plain,
( sk_c6 = sk_c5
| sk_c6 = multiply(sk_c6,sk_c5) ),
inference('PARAMODULATE',[status(thm)],[417,2112,theory(equality)]) ).
cnf(2755,plain,
( sk_c6 = sk_c5
| multiply(sk_c5,X) = multiply(sk_c1,multiply(sk_c6,X)) ),
inference('PARAMODULATE',[status(thm)],[associativity,2112,theory(equality)]) ).
cnf(3184,plain,
( identity = sk_c5
| identity = multiply(sk_c1,sk_c5) ),
inference('PARAMODULATE',[status(thm)],[2224,2751,theory(equality)]) ).
cnf(3310,plain,
( sk_c6 = sk_c5
| multiply(multiply(sk_c5,sk_c6),X) = X ),
inference('PARAMODULATE',[status(thm)],[associativity,2710,theory(equality)]) ).
cnf(4102,plain,
( sk_c6 = sk_c5
| X = multiply(X,sk_c5) ),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[141,2753,theory(equality)]),128,theory(equality)]) ).
cnf(4104,plain,
( sk_c6 = sk_c5
| multiply(sk_c5,X) = X ),
inference('PARAMODULATE',[status(thm)],[414,2755,theory(equality)]) ).
cnf(4755,plain,
( sk_c6 = sk_c5
| multiply(sk_c6,X) = X ),
inference('PARAMODULATE',[status(thm)],[3310,4104,theory(equality)]) ).
cnf(5181,plain,
( inverse(sk_c4) = inverse(sk_c3)
| identity = sk_c6
| identity = sk_c5 ),
inference('PARAMODULATE',[status(thm)],[2224,2311,theory(equality)]) ).
cnf(6756,plain,
sk_c6 = sk_c5,
inference('PARAMODULATE',[status(thm)],[4102,4755,theory(equality)]) ).
cnf(7175,plain,
( inverse(sk_c5) = sk_c5
| identity = multiply(inverse(sk_c3),sk_c4) ),
inference('REWRITE',[status(thm)],[2183,6756,theory(equality)]) ).
cnf(7180,plain,
( multiply(sk_c5,sk_c5) != identity
| inverse(sk_c5) != sk_c5
| multiply(X,sk_c5) != sk_c5
| inverse(X) != sk_c5
| Y != sk_c5
| identity != Y ),
inference('CONDENSE',[status(thm)],[inference('REWRITE',[status(thm)],[2190,6756,theory(equality)])]) ).
cnf(7188,plain,
( multiply(sk_c1,sk_c5) = sk_c5
| multiply(sk_c5,inverse(sk_c4)) = identity ),
inference('REWRITE',[status(thm)],[2201,6756,theory(equality)]) ).
cnf(7347,plain,
( inverse(sk_c3) = identity
| identity = sk_c5 ),
inference('REWRITE',[status(thm)],[2489,6756,theory(equality)]) ).
cnf(7390,plain,
( inverse(sk_c5) = sk_c5
| multiply(multiply(X,sk_c4),inverse(sk_c5)) = X ),
inference('REWRITE',[status(thm)],[2586,6756,theory(equality)]) ).
cnf(8177,plain,
( inverse(sk_c4) = inverse(sk_c3)
| identity = sk_c5 ),
inference('REWRITE',[status(thm)],[5181,6756,theory(equality)]) ).
cnf(16079,plain,
( multiply(sk_c1,sk_c5) = sk_c5
| inverse(sk_c5) = inverse(sk_c4) ),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[34,7188,theory(equality)]),left_identity,155,450,theory(equality)]) ).
cnf(16101,plain,
( inverse(sk_c5) = inverse(sk_c4)
| identity = sk_c5 ),
inference('PARAMODULATE',[status(thm)],[3184,16079,theory(equality)]) ).
cnf(16606,plain,
( inverse(sk_c5) = sk_c5
| inverse(sk_c5) = inverse(sk_c3) ),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[7390,7175,theory(equality)]),left_identity,theory(equality)]) ).
cnf(16648,plain,
( inverse(sk_c5) = sk_c5
| multiply(sk_c5,inverse(sk_c3)) = identity ),
inference('PARAMODULATE',[status(thm)],[172,16606,theory(equality)]) ).
cnf(21833,plain,
( identity = sk_c5
| inverse(sk_c5) = sk_c5 ),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[16648,7347,theory(equality)]),127,theory(equality)]) ).
cnf(21844,plain,
( identity = sk_c5
| inverse(sk_c4) = sk_c5 ),
inference('PARAMODULATE',[status(thm)],[16101,21833,theory(equality)]) ).
cnf(22068,plain,
( identity = sk_c5
| inverse(sk_c3) = sk_c5 ),
inference('PARAMODULATE',[status(thm)],[8177,21844,theory(equality)]) ).
cnf(23035,plain,
identity = sk_c5,
inference('PARAMODULATE',[status(thm)],[7347,22068,theory(equality)]) ).
cnf(23131,plain,
( X != identity
| inverse(X) != identity ),
inference('CONDENSE',[status(thm)],[inference('REWRITE',[status(thm)],[7180,127,155,left_identity,23035,theory(equality)])]) ).
cnf(24413,plain,
$false,
inference('HYPERRESOLVE',[status(thm)],[23131,155,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP363-1 : TPTP v8.1.0. Released v2.5.0.
% 0.03/0.13 % Command : run-snark %s %d
% 0.13/0.34 % Computer : n004.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.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Tue Jun 14 04:32:54 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.46 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.47 *
% 0.19/0.47 *
% 0.19/0.47 #<PACKAGE "SNARK-USER">
% 0.19/0.47 *
% 0.19/0.47 SNARK-TPTP-OPTIONS
% 0.19/0.47 *
% 0.19/0.48 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.19/0.48 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.19/0.48 (USE-FACTORING :POS)
% 0.19/0.48 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.19/0.48 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.19/0.48 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.19/0.48 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.19/0.48 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.19/0.48 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.19/0.48 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.19/0.48 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.19/0.48 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.19/0.48 (DECLARE-TPTP-SYMBOLS2))
% 0.19/0.48 *
% 0.19/0.48 "."
% 0.19/0.48 *
% 0.19/0.48 ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-14T04:32:54
% 0.19/0.48 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n004.cluster.edu at 2022-06-14T04:32:54
% 0.19/0.49
% 0.19/0.49 ; Recognized left identity assertion (= (|multiply| |identity| ?X) ?X).
% 0.19/0.49 ; Recognized possible left inverse assertion (= (|multiply| (|inverse| ?X) ?X) |identity|).
% 291.50/291.69 ; Recognized associativity assertion (= (|multiply| (|multiply| ?X ?Y) ?Z) (|multiply| ?X (|multiply| ?Y ?Z))).
% 291.50/291.69
% 291.50/291.69 #||
% 291.50/291.69 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 291.50/291.69 % SZS output start Refutation
% See solution above
% 291.50/291.72 ||#
% 291.50/291.72
% 291.50/291.72 ; Summary of computation:
% 291.50/291.72 ; 613258 formulas have been input or derived (from 1470 formulas).
% 291.50/291.72 ; 24413 ( 4%) were retained. Of these,
% 291.50/291.72 ; 20650 (85%) were simplified or subsumed later,
% 291.50/291.72 ; 3763 (15%) are still being kept.
% 291.50/291.72 ;
% 291.50/291.72 ; Run time in seconds excluding printing time:
% 291.50/291.72 ; 0.005 0% Read assertion file (1 call)
% 291.50/291.72 ; 0.002 0% Assert (28 calls)
% 291.50/291.72 ; 2.868 1% Process new row (222,019 calls)
% 291.50/291.72 ; 209.270 72% Resolution (2,938 calls)
% 291.50/291.72 ; 1.884 1% Paramodulation (1,469 calls)
% 291.50/291.72 ; 0.007 0% Factoring (1,441 calls)
% 291.50/291.72 ; 0.625 0% Condensing (188,011 calls)
% 291.50/291.72 ; 49.131 17% Forward subsumption (188,011 calls)
% 291.50/291.72 ; 2.835 1% Backward subsumption (24,032 calls)
% 291.50/291.72 ; 12.474 4% Clause clause subsumption (3,084,748 calls)
% 291.50/291.72 ; 8.142 3% Forward simplification (207,702 calls)
% 291.50/291.72 ; 1.100 0% Backward simplification (24,413 calls)
% 291.50/291.72 ; 2.085 1% Ordering (780,699 calls)
% 291.50/291.72 ; 0.001 0% Sortal reasoning (32 calls)
% 291.50/291.72 ; 0.000 0% Purity testing (1 call)
% 291.50/291.72 ; 0.776 0% Other
% 291.50/291.72 ; 291.205 Total
% 291.50/291.72 ; 291.242 Real time
% 291.50/291.72 ;
% 291.50/291.72 ; Term-hash-array has 11,196 terms in all.
% 291.50/291.72 ; Feature-vector-row-index has 3,408 entries (14,112 at peak, 24,032 added, 20,624 deleted).
% 291.50/291.72 ; Feature-vector-row-index has 7,048 nodes (35,502 at peak, 74,571 added, 67,523 deleted).
% 291.50/291.72 ; Retrieved 7,635,106 possibly forward subsuming rows in 188,011 calls.
% 291.50/291.72 ; Retrieved 218,742 possibly backward subsumed rows in 24,032 calls.
% 291.50/291.72 ; Path-index has 3,668 entries (8,883 at peak, 12,496 added, 8,828 deleted).
% 291.50/291.72 ; Path-index has 1,329 nodes (1,598 at peak, 2,128 added, 799 deleted).
% 291.50/291.72 ; Trie-index has 3,668 entries (8,883 at peak, 12,496 added, 8,828 deleted).
% 291.50/291.72 ; Trie-index has 12,415 nodes (27,104 at peak, 35,537 added, 23,122 deleted).
% 291.50/291.72 ; Retrieved 288,270 generalization terms in 1,654,073 calls.
% 291.50/291.72 ; Retrieved 2,945 instance terms in 994 calls.
% 291.50/291.72 ; Retrieved 181,495,544 unifiable terms in 3,290,446 calls.
% 291.50/291.72 ;
% 291.50/291.72 ; The agenda of rows to process has 67 entries:
% 291.50/291.72 ; 2 with value 8 2 with value 15 3 with value 20
% 291.50/291.72 ; 1 with value 9 4 with value 16 2 with value 21
% 291.50/291.72 ; 2 with value 11 4 with value 17 7 with value 22
% 291.50/291.72 ; 4 with value 12 6 with value 18 9 with value 23
% 291.50/291.72 ; 5 with value 13 7 with value 19 8 with value 24
% 291.50/291.72 ; 1 with value 14
% 291.50/291.72 ; The agenda of rows to give has 3601 entries:
% 291.50/291.72 ; 1 with value (4 12) 152 with value (4 21) 361 with value (4 28)
% 291.50/291.72 ; 5 with value (4 15) 172 with value (4 22) 291 with value (4 29)
% 291.50/291.72 ; 5 with value (4 16) 211 with value (4 23) 566 with value (4 30)
% 291.50/291.72 ; 6 with value (4 17) 214 with value (4 24) 462 with value (4 31)
% 291.50/291.72 ; 15 with value (4 18) 307 with value (4 25) 36 with value (4 32)
% 291.50/291.72 ; 35 with value (4 19) 363 with value (4 26) 24 with value (4 33)
% 291.50/291.72 ; 38 with value (4 20) 332 with value (4 27) 5 with value (4 34)
% 291.50/291.72 Evaluation took:
% 291.50/291.72 291.243 seconds of real time
% 291.50/291.72 284.72852 seconds of user run time
% 291.50/291.72 6.510045 seconds of system run time
% 291.50/291.72 [Run times include 13.872 seconds GC run time.]
% 291.50/291.72 0 calls to %EVAL
% 291.50/291.72 0 page faults and
% 291.50/291.72 24,901,812,160 bytes consed.
% 291.50/291.72 :PROOF-FOUND
% 291.50/291.72 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-14T04:37:45
% 291.50/291.72 :PROOF-FOUND
% 291.50/291.72 *
%------------------------------------------------------------------------------