TSTP Solution File: GRP211-1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : GRP211-1 : TPTP v8.1.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n029.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:37:33 EDT 2022
% Result : Unsatisfiable 132.76s 133.03s
% Output : Refutation 132.76s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 22
% Syntax : Number of clauses : 101 ( 34 unt; 61 nHn; 66 RR)
% Number of literals : 198 ( 197 equ; 42 neg)
% Maximal clause size : 10 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 9 con; 0-2 aty)
% Number of variables : 76 ( 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_1,negated_conjecture,
( multiply(sk_c1,sk_c2) = sk_c8
| inverse(sk_c4) = sk_c8 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_1) ).
cnf(prove_this_2,negated_conjecture,
( multiply(sk_c1,sk_c2) = sk_c8
| multiply(sk_c4,sk_c7) = sk_c8 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_2) ).
cnf(prove_this_3,negated_conjecture,
( multiply(sk_c1,sk_c2) = sk_c8
| multiply(sk_c8,sk_c6) = sk_c7 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_3) ).
cnf(prove_this_4,negated_conjecture,
( multiply(sk_c1,sk_c2) = sk_c8
| multiply(sk_c5,sk_c8) = sk_c6 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_4) ).
cnf(prove_this_5,negated_conjecture,
( multiply(sk_c1,sk_c2) = sk_c8
| inverse(sk_c5) = sk_c8 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_5) ).
cnf(prove_this_6,negated_conjecture,
( inverse(sk_c1) = sk_c2
| inverse(sk_c4) = sk_c8 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_6) ).
cnf(prove_this_7,negated_conjecture,
( inverse(sk_c1) = sk_c2
| multiply(sk_c4,sk_c7) = sk_c8 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_7) ).
cnf(prove_this_8,negated_conjecture,
( inverse(sk_c1) = sk_c2
| multiply(sk_c8,sk_c6) = sk_c7 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_8) ).
cnf(prove_this_9,negated_conjecture,
( inverse(sk_c1) = sk_c2
| multiply(sk_c5,sk_c8) = sk_c6 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_9) ).
cnf(prove_this_10,negated_conjecture,
( inverse(sk_c1) = sk_c2
| inverse(sk_c5) = sk_c8 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_10) ).
cnf(prove_this_16,negated_conjecture,
( inverse(sk_c3) = sk_c8
| inverse(sk_c4) = sk_c8 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_16) ).
cnf(prove_this_17,negated_conjecture,
( inverse(sk_c3) = sk_c8
| multiply(sk_c4,sk_c7) = sk_c8 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_17) ).
cnf(prove_this_18,negated_conjecture,
( inverse(sk_c3) = sk_c8
| multiply(sk_c8,sk_c6) = sk_c7 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_18) ).
cnf(prove_this_19,negated_conjecture,
( inverse(sk_c3) = sk_c8
| multiply(sk_c5,sk_c8) = sk_c6 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_19) ).
cnf(prove_this_20,negated_conjecture,
( inverse(sk_c3) = sk_c8
| inverse(sk_c5) = sk_c8 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_20) ).
cnf(prove_this_23,negated_conjecture,
( multiply(sk_c3,sk_c7) = sk_c8
| multiply(sk_c8,sk_c6) = sk_c7 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_23) ).
cnf(prove_this_24,negated_conjecture,
( multiply(sk_c3,sk_c7) = sk_c8
| multiply(sk_c5,sk_c8) = sk_c6 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_24) ).
cnf(prove_this_25,negated_conjecture,
( multiply(sk_c3,sk_c7) = sk_c8
| inverse(sk_c5) = sk_c8 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_25) ).
cnf(prove_this_26,negated_conjecture,
( multiply(X,Y) != sk_c8
| inverse(X) != Y
| multiply(Y,sk_c7) != sk_c8
| inverse(Z) != sk_c8
| multiply(Z,sk_c7) != sk_c8
| inverse(U) != sk_c8
| multiply(U,sk_c7) != sk_c8
| multiply(sk_c8,V) != sk_c7
| multiply(W,sk_c8) != V
| inverse(W) != sk_c8 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_26) ).
cnf(30,plain,
( multiply(X,Y) != sk_c8
| inverse(X) != Y
| multiply(Y,sk_c7) != sk_c8
| inverse(Z) != sk_c8
| multiply(Z,sk_c7) != sk_c8
| multiply(sk_c8,U) != sk_c7
| multiply(V,sk_c8) != U
| inverse(V) != sk_c8 ),
inference('CONDENSE',[status(thm)],[prove_this_26]) ).
cnf(32,plain,
( inverse(sk_c1) = sk_c2
| multiply(sk_c8,sk_c5) = identity ),
inference('PARAMODULATE',[status(thm)],[left_inverse,prove_this_10,theory(equality)]) ).
cnf(34,plain,
( inverse(sk_c3) = sk_c8
| multiply(sk_c8,sk_c5) = identity ),
inference('PARAMODULATE',[status(thm)],[left_inverse,prove_this_20,theory(equality)]) ).
cnf(36,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(37,plain,
multiply(multiply(X,inverse(Y)),Y) = multiply(X,identity),
inference('PARAMODULATE',[status(thm)],[associativity,left_inverse,theory(equality)]) ).
cnf(38,plain,
( inverse(sk_c3) = sk_c8
| multiply(sk_c7,X) = multiply(sk_c8,multiply(sk_c6,X)) ),
inference('PARAMODULATE',[status(thm)],[associativity,prove_this_18,theory(equality)]) ).
cnf(39,plain,
( inverse(sk_c1) = sk_c2
| multiply(sk_c7,X) = multiply(sk_c8,multiply(sk_c6,X)) ),
inference('PARAMODULATE',[status(thm)],[associativity,prove_this_8,theory(equality)]) ).
cnf(63,plain,
multiply(multiply(X,multiply(Y,Z)),U) = multiply(X,multiply(Y,multiply(Z,U))),
inference('PARAMODULATE',[status(thm)],[associativity,associativity,theory(equality)]) ).
cnf(69,plain,
( multiply(sk_c1,sk_c2) = sk_c8
| multiply(sk_c7,X) = multiply(sk_c8,multiply(sk_c6,X)) ),
inference('PARAMODULATE',[status(thm)],[associativity,prove_this_3,theory(equality)]) ).
cnf(84,plain,
( multiply(sk_c3,sk_c7) = sk_c8
| multiply(multiply(X,sk_c5),sk_c8) = multiply(X,sk_c6) ),
inference('PARAMODULATE',[status(thm)],[associativity,prove_this_24,theory(equality)]) ).
cnf(89,plain,
( identity != sk_c8
| inverse(inverse(X)) != X
| multiply(X,sk_c7) != sk_c8
| inverse(Y) != sk_c8
| multiply(Y,sk_c7) != sk_c8
| multiply(sk_c8,Z) != sk_c7
| multiply(U,sk_c8) != Z
| inverse(U) != sk_c8 ),
inference('PARAMODULATE',[status(thm)],[30,left_inverse,theory(equality)]) ).
cnf(161,plain,
X = multiply(inverse(inverse(X)),identity),
inference('PARAMODULATE',[status(thm)],[36,left_inverse,theory(equality)]) ).
cnf(162,plain,
multiply(X,Y) = multiply(inverse(inverse(X)),Y),
inference('PARAMODULATE',[status(thm)],[36,36,theory(equality)]) ).
cnf(163,plain,
X = multiply(X,identity),
inference('REWRITE',[status(thm)],[161,162,theory(equality)]) ).
cnf(164,plain,
multiply(multiply(X,inverse(Y)),Y) = X,
inference('REWRITE',[status(thm)],[37,163,theory(equality)]) ).
cnf(168,plain,
( inverse(sk_c3) = sk_c8
| sk_c7 = multiply(inverse(sk_c4),sk_c8) ),
inference('PARAMODULATE',[status(thm)],[36,prove_this_17,theory(equality)]) ).
cnf(169,plain,
( inverse(sk_c1) = sk_c2
| sk_c7 = multiply(inverse(sk_c4),sk_c8) ),
inference('PARAMODULATE',[status(thm)],[36,prove_this_7,theory(equality)]) ).
cnf(172,plain,
( inverse(sk_c5) = sk_c8
| sk_c7 = multiply(inverse(sk_c3),sk_c8) ),
inference('PARAMODULATE',[status(thm)],[36,prove_this_25,theory(equality)]) ).
cnf(176,plain,
( inverse(sk_c5) = sk_c8
| sk_c2 = multiply(inverse(sk_c1),sk_c8) ),
inference('PARAMODULATE',[status(thm)],[36,prove_this_5,theory(equality)]) ).
cnf(178,plain,
multiply(multiply(X,inverse(Y)),multiply(Y,Z)) = multiply(X,Z),
inference('PARAMODULATE',[status(thm)],[associativity,36,theory(equality)]) ).
cnf(194,plain,
inverse(identity) = identity,
inference('PARAMODULATE',[status(thm)],[left_inverse,163,theory(equality)]) ).
cnf(199,plain,
inverse(inverse(X)) = X,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[164,left_inverse,theory(equality)]),left_identity,theory(equality)]) ).
cnf(201,plain,
( identity != sk_c8
| inverse(X) != sk_c8
| multiply(X,sk_c7) != sk_c8
| multiply(sk_c8,Y) != sk_c7
| multiply(Z,sk_c8) != Y
| inverse(Z) != sk_c8 ),
inference('CONDENSE',[status(thm)],[inference('REWRITE',[status(thm)],[89,199,theory(equality)])]) ).
cnf(206,plain,
( inverse(sk_c3) = sk_c8
| multiply(multiply(X,sk_c8),sk_c4) = X ),
inference('PARAMODULATE',[status(thm)],[164,prove_this_16,theory(equality)]) ).
cnf(207,plain,
( inverse(sk_c1) = sk_c2
| multiply(multiply(X,sk_c8),sk_c4) = X ),
inference('PARAMODULATE',[status(thm)],[164,prove_this_6,theory(equality)]) ).
cnf(212,plain,
multiply(X,inverse(X)) = identity,
inference('PARAMODULATE',[status(thm)],[left_inverse,199,theory(equality)]) ).
cnf(213,plain,
multiply(multiply(X,Y),inverse(Y)) = X,
inference('PARAMODULATE',[status(thm)],[164,199,theory(equality)]) ).
cnf(214,plain,
X = multiply(Y,multiply(inverse(Y),X)),
inference('PARAMODULATE',[status(thm)],[36,199,theory(equality)]) ).
cnf(231,plain,
inverse(X) = multiply(inverse(multiply(Y,X)),Y),
inference('PARAMODULATE',[status(thm)],[36,213,theory(equality)]) ).
cnf(326,plain,
( inverse(sk_c3) = sk_c8
| sk_c7 = multiply(sk_c8,sk_c8) ),
inference('PARAMODULATE',[status(thm)],[168,prove_this_16,theory(equality)]) ).
cnf(339,plain,
( inverse(sk_c1) = sk_c2
| sk_c7 = multiply(sk_c8,sk_c8) ),
inference('PARAMODULATE',[status(thm)],[169,prove_this_6,theory(equality)]) ).
cnf(486,plain,
multiply(inverse(X),inverse(Y)) = inverse(multiply(Y,X)),
inference('PARAMODULATE',[status(thm)],[213,231,theory(equality)]) ).
cnf(487,plain,
multiply(inverse(X),Y) = inverse(multiply(inverse(Y),X)),
inference('PARAMODULATE',[status(thm)],[164,231,theory(equality)]) ).
cnf(748,plain,
( inverse(sk_c3) = sk_c8
| multiply(sk_c6,sk_c4) = sk_c5 ),
inference('PARAMODULATE',[status(thm)],[206,prove_this_19,theory(equality)]) ).
cnf(750,plain,
( inverse(sk_c3) = sk_c8
| multiply(sk_c7,sk_c4) = sk_c8 ),
inference('PARAMODULATE',[status(thm)],[206,326,theory(equality)]) ).
cnf(771,plain,
( inverse(sk_c1) = sk_c2
| multiply(sk_c6,sk_c4) = sk_c5 ),
inference('PARAMODULATE',[status(thm)],[207,prove_this_9,theory(equality)]) ).
cnf(773,plain,
( inverse(sk_c1) = sk_c2
| multiply(sk_c7,sk_c4) = sk_c8 ),
inference('PARAMODULATE',[status(thm)],[207,339,theory(equality)]) ).
cnf(881,plain,
( inverse(sk_c3) = sk_c8
| multiply(sk_c7,sk_c4) = multiply(sk_c8,sk_c5) ),
inference('PARAMODULATE',[status(thm)],[38,748,theory(equality)]) ).
cnf(890,plain,
( inverse(sk_c1) = sk_c2
| multiply(sk_c7,sk_c4) = multiply(sk_c8,sk_c5) ),
inference('PARAMODULATE',[status(thm)],[39,771,theory(equality)]) ).
cnf(2085,plain,
( inverse(sk_c3) = sk_c8
| multiply(sk_c7,sk_c4) = identity ),
inference('PARAMODULATE',[status(thm)],[34,881,theory(equality)]) ).
cnf(2102,plain,
( inverse(sk_c3) = sk_c8
| inverse(sk_c7) = sk_c4 ),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[36,2085,theory(equality)]),left_identity,194,487,theory(equality)]) ).
cnf(2215,plain,
inverse(sk_c3) = sk_c8,
inference('HYPERRESOLVE',[status(thm)],[30,2102,750,prove_this_17,prove_this_16,prove_this_17,prove_this_18,prove_this_19,prove_this_20]) ).
cnf(2220,plain,
( inverse(sk_c5) = sk_c8
| sk_c7 = multiply(sk_c8,sk_c8) ),
inference('REWRITE',[status(thm)],[172,2215,theory(equality)]) ).
cnf(2245,plain,
inverse(sk_c8) = sk_c3,
inference('PARAMODULATE',[status(thm)],[199,2215,theory(equality)]) ).
cnf(2293,plain,
multiply(sk_c8,sk_c3) = identity,
inference('PARAMODULATE',[status(thm)],[left_inverse,2215,theory(equality)]) ).
cnf(2295,plain,
multiply(multiply(X,sk_c3),sk_c8) = X,
inference('PARAMODULATE',[status(thm)],[213,2215,theory(equality)]) ).
cnf(2338,plain,
multiply(inverse(X),sk_c8) = inverse(multiply(sk_c3,X)),
inference('PARAMODULATE',[status(thm)],[486,2215,theory(equality)]) ).
cnf(2371,plain,
( inverse(sk_c5) = sk_c8
| sk_c2 = inverse(multiply(sk_c3,sk_c1)) ),
inference('REWRITE',[status(thm)],[176,2338,theory(equality)]) ).
cnf(2528,plain,
( inverse(sk_c5) = sk_c8
| X = multiply(multiply(sk_c3,sk_c1),multiply(sk_c2,X)) ),
inference('PARAMODULATE',[status(thm)],[214,2371,theory(equality)]) ).
cnf(2530,plain,
( inverse(sk_c5) = sk_c8
| multiply(X,multiply(sk_c3,multiply(sk_c1,sk_c2))) = X ),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[213,2371,theory(equality)]),63,theory(equality)]) ).
cnf(2950,plain,
( inverse(sk_c1) = sk_c2
| multiply(sk_c7,sk_c4) = identity ),
inference('PARAMODULATE',[status(thm)],[32,890,theory(equality)]) ).
cnf(2968,plain,
( inverse(sk_c1) = sk_c2
| inverse(sk_c7) = sk_c4 ),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[36,2950,theory(equality)]),left_identity,194,487,theory(equality)]) ).
cnf(3069,plain,
inverse(sk_c1) = sk_c2,
inference('HYPERRESOLVE',[status(thm)],[30,2968,773,prove_this_7,prove_this_6,prove_this_7,prove_this_8,prove_this_9,prove_this_10]) ).
cnf(3090,plain,
inverse(sk_c2) = sk_c1,
inference('PARAMODULATE',[status(thm)],[199,3069,theory(equality)]) ).
cnf(3168,plain,
multiply(sk_c1,sk_c2) = identity,
inference('PARAMODULATE',[status(thm)],[212,3069,theory(equality)]) ).
cnf(3169,plain,
( identity = sk_c8
| inverse(sk_c4) = sk_c8 ),
inference('REWRITE',[status(thm)],[prove_this_1,3168,theory(equality)]) ).
cnf(3170,plain,
( identity = sk_c8
| multiply(sk_c4,sk_c7) = sk_c8 ),
inference('REWRITE',[status(thm)],[prove_this_2,3168,theory(equality)]) ).
cnf(3172,plain,
( identity = sk_c8
| multiply(sk_c5,sk_c8) = sk_c6 ),
inference('REWRITE',[status(thm)],[prove_this_4,3168,theory(equality)]) ).
cnf(3176,plain,
( identity = sk_c8
| multiply(sk_c7,X) = multiply(sk_c8,multiply(sk_c6,X)) ),
inference('REWRITE',[status(thm)],[69,3168,theory(equality)]) ).
cnf(3224,plain,
( inverse(sk_c5) = sk_c8
| multiply(X,sk_c3) = X ),
inference('REWRITE',[status(thm)],[2530,163,3168,theory(equality)]) ).
cnf(3280,plain,
( identity = sk_c8
| multiply(multiply(X,sk_c8),sk_c4) = X ),
inference('PARAMODULATE',[status(thm)],[164,3169,theory(equality)]) ).
cnf(3281,plain,
( identity = sk_c8
| X = multiply(sk_c8,multiply(sk_c4,X)) ),
inference('PARAMODULATE',[status(thm)],[36,3169,theory(equality)]) ).
cnf(3347,plain,
multiply(multiply(X,sk_c1),multiply(sk_c2,Y)) = multiply(X,Y),
inference('PARAMODULATE',[status(thm)],[178,3090,theory(equality)]) ).
cnf(3348,plain,
( inverse(sk_c5) = sk_c8
| X = multiply(sk_c3,X) ),
inference('REWRITE',[status(thm)],[2528,3347,theory(equality)]) ).
cnf(3635,plain,
( identity = sk_c8
| multiply(sk_c6,sk_c4) = sk_c5 ),
inference('PARAMODULATE',[status(thm)],[3280,3172,theory(equality)]) ).
cnf(3664,plain,
( identity = sk_c8
| sk_c7 = multiply(sk_c8,sk_c8) ),
inference('PARAMODULATE',[status(thm)],[3281,3170,theory(equality)]) ).
cnf(3674,plain,
( identity = sk_c8
| multiply(sk_c7,sk_c4) = sk_c8 ),
inference('PARAMODULATE',[status(thm)],[3280,3664,theory(equality)]) ).
cnf(3940,plain,
( identity = sk_c8
| multiply(sk_c7,sk_c4) = multiply(sk_c8,sk_c5) ),
inference('PARAMODULATE',[status(thm)],[3176,3635,theory(equality)]) ).
cnf(4208,plain,
inverse(sk_c5) = sk_c8,
inference('HYPERRESOLVE',[status(thm)],[30,3348,3224,2245,prove_this_25,2215,prove_this_25,2220,2215]) ).
cnf(4232,plain,
sk_c3 = sk_c5,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[199,4208,theory(equality)]),2245,theory(equality)]) ).
cnf(4238,plain,
( multiply(sk_c3,sk_c7) = sk_c8
| X = multiply(X,sk_c6) ),
inference('REWRITE',[status(thm)],[84,2295,4232,theory(equality)]) ).
cnf(4280,plain,
( identity = sk_c8
| multiply(sk_c7,sk_c4) = identity ),
inference('REWRITE',[status(thm)],[3940,2293,4232,theory(equality)]) ).
cnf(4467,plain,
( multiply(sk_c3,sk_c7) = sk_c8
| sk_c7 = sk_c8 ),
inference('PARAMODULATE',[status(thm)],[prove_this_23,4238,theory(equality)]) ).
cnf(4494,plain,
identity = sk_c8,
inference('PARAMODULATE',[status(thm)],[3674,4280,theory(equality)]) ).
cnf(4533,plain,
( inverse(X) != identity
| multiply(X,sk_c7) != identity
| Y != sk_c7
| Z != Y
| inverse(Z) != identity ),
inference('REWRITE',[status(thm)],[201,163,left_identity,4494,theory(equality)]) ).
cnf(4592,plain,
sk_c3 = identity,
inference('REWRITE',[status(thm)],[2245,194,4494,theory(equality)]) ).
cnf(4809,plain,
identity = sk_c7,
inference('REWRITE',[status(thm)],[4467,left_identity,4592,4494,theory(equality)]) ).
cnf(4819,plain,
( inverse(X) != identity
| identity != X
| Y != identity
| Z != Y
| inverse(Z) != identity ),
inference('REWRITE',[status(thm)],[4533,163,4809,theory(equality)]) ).
cnf(7563,plain,
$false,
inference('HYPERRESOLVE',[status(thm)],[4819,194,194,theory(equality),theory(equality),theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : GRP211-1 : TPTP v8.1.0. Released v2.5.0.
% 0.11/0.12 % Command : run-snark %s %d
% 0.12/0.33 % Computer : n029.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Tue Jun 14 06:33:40 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.45 *
% 0.18/0.45 *
% 0.18/0.45 #<PACKAGE "SNARK-USER">
% 0.18/0.45 *
% 0.18/0.45 SNARK-TPTP-OPTIONS
% 0.18/0.45 *
% 0.18/0.45 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.18/0.46 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.18/0.46 (USE-FACTORING :POS)
% 0.18/0.46 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.18/0.46 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.18/0.46 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.18/0.46 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.18/0.46 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.18/0.46 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.18/0.46 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.18/0.46 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.18/0.46 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.18/0.46 (DECLARE-TPTP-SYMBOLS2))
% 0.18/0.46 *
% 0.18/0.46 "."
% 0.18/0.46 *
% 0.18/0.46 ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-14T06:33:40
% 0.18/0.46 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n029.cluster.edu at 2022-06-14T06:33:40
% 0.18/0.47
% 0.18/0.47 ; Recognized left identity assertion (= (|multiply| |identity| ?X) ?X).
% 0.18/0.47 ; Recognized possible left inverse assertion (= (|multiply| (|inverse| ?X) ?X) |identity|).
% 132.76/133.03 ; Recognized associativity assertion (= (|multiply| (|multiply| ?X ?Y) ?Z) (|multiply| ?X (|multiply| ?Y ?Z))).
% 132.76/133.03
% 132.76/133.03 #||
% 132.76/133.03 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 132.76/133.03 % SZS output start Refutation
% See solution above
% 132.76/133.05 ||#
% 132.76/133.05
% 132.76/133.05 ; Summary of computation:
% 132.76/133.05 ; 283021 formulas have been input or derived (from 621 formulas).
% 132.76/133.05 ; 7563 ( 3%) were retained. Of these,
% 132.76/133.05 ; 5844 (77%) were simplified or subsumed later,
% 132.76/133.05 ; 1719 (23%) are still being kept.
% 132.76/133.05 ;
% 132.76/133.05 ; Run time in seconds excluding printing time:
% 132.76/133.05 ; 0.006 0% Read assertion file (1 call)
% 132.76/133.05 ; 0.002 0% Assert (29 calls)
% 132.76/133.05 ; 1.722 1% Process new row (187,858 calls)
% 132.76/133.06 ; 62.387 47% Resolution (1,240 calls)
% 132.76/133.06 ; 0.404 0% Paramodulation (620 calls)
% 132.76/133.06 ; 0.004 0% Factoring (542 calls)
% 132.76/133.06 ; 0.555 0% Condensing (161,563 calls)
% 132.76/133.06 ; 49.031 37% Forward subsumption (161,563 calls)
% 132.76/133.06 ; 0.320 0% Backward subsumption (5,670 calls)
% 132.76/133.06 ; 5.140 4% Clause clause subsumption (924,269 calls)
% 132.76/133.06 ; 9.274 7% Forward simplification (173,530 calls)
% 132.76/133.06 ; 0.511 0% Backward simplification (7,562 calls)
% 132.76/133.06 ; 2.397 2% Ordering (269,585 calls)
% 132.76/133.06 ; 0.000 0% Sortal reasoning (32 calls)
% 132.76/133.06 ; 0.000 0% Purity testing (1 call)
% 132.76/133.06 ; 0.750 1% Other
% 132.76/133.06 ; 132.503 Total
% 132.76/133.06 ; 132.600 Real time
% 132.76/133.06 ;
% 132.76/133.06 ; Term-hash-array has 7,590 terms in all.
% 132.76/133.06 ; Feature-vector-row-index has 3 entries (2,040 at peak, 5,670 added, 5,667 deleted).
% 132.76/133.06 ; Feature-vector-row-index has 13 nodes (12,841 at peak, 30,854 added, 30,841 deleted).
% 132.76/133.06 ; Retrieved 6,251,982 possibly forward subsuming rows in 161,563 calls.
% 132.76/133.06 ; Retrieved 9,839 possibly backward subsumed rows in 5,670 calls.
% 132.76/133.06 ; Path-index has 4,276 entries (4,276 at peak, 8,572 added, 4,296 deleted).
% 132.76/133.06 ; Path-index has 2,191 nodes (2,191 at peak, 3,017 added, 826 deleted).
% 132.76/133.06 ; Trie-index has 4,276 entries (4,276 at peak, 8,572 added, 4,296 deleted).
% 132.76/133.06 ; Trie-index has 18,995 nodes (18,995 at peak, 29,950 added, 10,955 deleted).
% 132.76/133.06 ; Retrieved 140,951 generalization terms in 1,758,647 calls.
% 132.76/133.06 ; Retrieved 19,070 instance terms in 5,129 calls.
% 132.76/133.06 ; Retrieved 57,818,032 unifiable terms in 707,742 calls.
% 132.76/133.06 ;
% 132.76/133.06 ; The agenda of rows to process has 1411 entries:
% 132.76/133.06 ; 12 with value 8 67 with value 18 80 with value 28
% 132.76/133.06 ; 3 with value 9 56 with value 19 44 with value 29
% 132.76/133.06 ; 22 with value 10 66 with value 20 24 with value 30
% 132.76/133.06 ; 12 with value 11 147 with value 21 6 with value 31
% 132.76/133.06 ; 31 with value 12 58 with value 22 8 with value 32
% 132.76/133.06 ; 48 with value 13 68 with value 23 12 with value 33
% 132.76/133.06 ; 28 with value 14 126 with value 24 4 with value 38
% 132.76/133.06 ; 70 with value 15 104 with value 25 4 with value 42
% 132.76/133.06 ; 60 with value 16 54 with value 26 8 with value 45
% 132.76/133.06 ; 85 with value 17 104 with value 27
% 132.76/133.06 ; The agenda of rows to give has 1657 entries:
% 132.76/133.06 ; 7 with value (4 25) 118 with value (4 30) 296 with value (4 35)
% 132.76/133.06 ; 63 with value (4 26) 230 with value (4 31) 310 with value (4 36)
% 132.76/133.06 ; 27 with value (4 27) 228 with value (4 32) 61 with value (4 37)
% 132.76/133.06 ; 26 with value (4 28) 91 with value (4 33) 5 with value (4 38)
% 132.76/133.06 ; 47 with value (4 29) 140 with value (4 34) 8 with value (4 39)
% 132.76/133.06 Evaluation took:
% 132.76/133.06 132.601 seconds of real time
% 132.76/133.06 129.23854 seconds of user run time
% 132.76/133.06 3.293762 seconds of system run time
% 132.76/133.06 [Run times include 6.025 seconds GC run time.]
% 132.76/133.06 0 calls to %EVAL
% 132.76/133.06 0 page faults and
% 132.76/133.06 11,603,205,424 bytes consed.
% 132.76/133.06 :PROOF-FOUND
% 132.76/133.06 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-14T06:35:53
% 132.76/133.06 :PROOF-FOUND
% 132.76/133.06 *
%------------------------------------------------------------------------------