TSTP Solution File: GRP433-1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : GRP433-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n010.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:35 EDT 2022
% Result : Unsatisfiable 0.66s 0.82s
% Output : Refutation 0.66s
% Verified :
% SZS Type : Refutation
% Derivation depth : 26
% Number of leaves : 2
% Syntax : Number of clauses : 52 ( 52 unt; 0 nHn; 2 RR)
% Number of literals : 52 ( 51 equ; 1 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 13 ( 3 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 159 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
inverse(multiply(multiply(multiply(inverse(multiply(multiply(X,Y),Z)),X),Y),multiply(U,inverse(U)))) = Z,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',single_axiom) ).
cnf(prove_these_axioms_1,negated_conjecture,
multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_these_axioms_1) ).
cnf(3,plain,
inverse(multiply(multiply(multiply(X,multiply(inverse(multiply(multiply(Y,Z),X)),Y)),Z),multiply(U,inverse(U)))) = multiply(V,inverse(V)),
inference('PARAMODULATE',[status(thm)],[single_axiom,single_axiom,theory(equality)]) ).
cnf(5,plain,
multiply(X,inverse(X)) = multiply(Y,inverse(Y)),
inference('PARAMODULATE',[status(thm)],[3,3,theory(equality)]) ).
cnf(20,plain,
inverse(multiply(multiply(multiply(inverse(multiply(X,inverse(X))),Y),Z),multiply(U,inverse(U)))) = inverse(multiply(Y,Z)),
inference('PARAMODULATE',[status(thm)],[single_axiom,5,theory(equality)]) ).
cnf(21,plain,
inverse(multiply(multiply(multiply(inverse(multiply(multiply(X,inverse(X)),Y)),Z),inverse(Z)),multiply(U,inverse(U)))) = Y,
inference('PARAMODULATE',[status(thm)],[single_axiom,5,theory(equality)]) ).
cnf(27,plain,
inverse(multiply(multiply(multiply(X,inverse(X)),Y),multiply(Z,inverse(Z)))) = inverse(multiply(inverse(inverse(multiply(U,inverse(U)))),Y)),
inference('PARAMODULATE',[status(thm)],[20,5,theory(equality)]) ).
cnf(43,plain,
inverse(multiply(X,inverse(X))) = inverse(multiply(Y,inverse(Y))),
inference('PARAMODULATE',[status(thm)],[20,21,theory(equality)]) ).
cnf(67,plain,
multiply(multiply(X,inverse(X)),inverse(multiply(Y,inverse(Y)))) = multiply(Z,inverse(Z)),
inference('PARAMODULATE',[status(thm)],[5,43,theory(equality)]) ).
cnf(68,plain,
inverse(multiply(multiply(X,inverse(X)),inverse(multiply(Y,inverse(Y))))) = inverse(multiply(Z,inverse(Z))),
inference('PARAMODULATE',[status(thm)],[43,43,theory(equality)]) ).
cnf(73,plain,
inverse(multiply(multiply(multiply(inverse(multiply(multiply(X,inverse(X)),Y)),multiply(Z,inverse(Z))),inverse(multiply(U,inverse(U)))),multiply(V,inverse(V)))) = Y,
inference('PARAMODULATE',[status(thm)],[21,43,theory(equality)]) ).
cnf(86,plain,
inverse(multiply(multiply(inverse(multiply(X,inverse(X))),Y),inverse(Y))) = multiply(Z,inverse(Z)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[3,67,theory(equality)]),20,theory(equality)]) ).
cnf(87,plain,
inverse(multiply(multiply(multiply(multiply(X,inverse(X)),inverse(multiply(Y,inverse(Y)))),Z),multiply(U,inverse(U)))) = inverse(multiply(inverse(inverse(multiply(V,inverse(V)))),Z)),
inference('PARAMODULATE',[status(thm)],[20,67,theory(equality)]) ).
cnf(91,plain,
inverse(multiply(multiply(multiply(multiply(X,inverse(X)),inverse(multiply(Y,inverse(Y)))),inverse(inverse(inverse(multiply(multiply(Z,inverse(Z)),U))))),multiply(V,inverse(V)))) = U,
inference('PARAMODULATE',[status(thm)],[21,67,theory(equality)]) ).
cnf(149,plain,
inverse(multiply(multiply(multiply(inverse(multiply(multiply(multiply(X,inverse(X)),inverse(multiply(multiply(Y,inverse(Y)),inverse(multiply(Z,inverse(Z)))))),U)),V),inverse(V)),multiply(W,inverse(W)))) = U,
inference('PARAMODULATE',[status(thm)],[21,68,theory(equality)]) ).
cnf(156,plain,
inverse(multiply(multiply(multiply(multiply(X,inverse(X)),inverse(multiply(Y,inverse(Y)))),Z),multiply(U,inverse(U)))) = inverse(Z),
inference('PARAMODULATE',[status(thm)],[single_axiom,86,theory(equality)]) ).
cnf(157,plain,
inverse(inverse(inverse(inverse(multiply(multiply(X,inverse(X)),Y))))) = Y,
inference('REWRITE',[status(thm)],[91,156,theory(equality)]) ).
cnf(158,plain,
inverse(X) = inverse(multiply(inverse(inverse(multiply(Y,inverse(Y)))),X)),
inference('REWRITE',[status(thm)],[87,156,theory(equality)]) ).
cnf(161,plain,
inverse(multiply(multiply(multiply(X,inverse(X)),Y),multiply(Z,inverse(Z)))) = inverse(Y),
inference('REWRITE',[status(thm)],[27,158,theory(equality)]) ).
cnf(185,plain,
inverse(multiply(multiply(multiply(inverse(multiply(X,inverse(X))),Y),Z),inverse(multiply(multiply(inverse(multiply(U,inverse(U))),V),inverse(V))))) = inverse(multiply(Y,Z)),
inference('PARAMODULATE',[status(thm)],[20,86,theory(equality)]) ).
cnf(202,plain,
inverse(multiply(multiply(multiply(inverse(multiply(inverse(multiply(multiply(inverse(multiply(X,inverse(X))),Y),inverse(Y))),Z)),U),inverse(U)),multiply(V,inverse(V)))) = Z,
inference('PARAMODULATE',[status(thm)],[21,86,theory(equality)]) ).
cnf(222,plain,
inverse(X) = inverse(multiply(inverse(inverse(inverse(inverse(inverse(multiply(Y,inverse(Y))))))),X)),
inference('PARAMODULATE',[status(thm)],[158,158,theory(equality)]) ).
cnf(255,plain,
inverse(multiply(multiply(multiply(inverse(multiply(multiply(multiply(inverse(inverse(multiply(X,inverse(X)))),Y),inverse(Y)),Z)),U),inverse(U)),multiply(V,inverse(V)))) = Z,
inference('PARAMODULATE',[status(thm)],[21,158,theory(equality)]) ).
cnf(261,plain,
inverse(multiply(multiply(multiply(X,inverse(X)),Y),multiply(multiply(Z,inverse(Z)),inverse(multiply(U,inverse(U)))))) = inverse(Y),
inference('PARAMODULATE',[status(thm)],[161,43,theory(equality)]) ).
cnf(263,plain,
inverse(inverse(multiply(X,inverse(X)))) = inverse(inverse(multiply(Y,inverse(Y)))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[161,67,theory(equality)]),161,theory(equality)]) ).
cnf(287,plain,
inverse(multiply(multiply(multiply(multiply(X,inverse(X)),inverse(multiply(multiply(Y,inverse(Y)),inverse(multiply(Z,inverse(Z)))))),U),multiply(V,inverse(V)))) = inverse(U),
inference('PARAMODULATE',[status(thm)],[161,68,theory(equality)]) ).
cnf(314,plain,
inverse(X) = inverse(multiply(inverse(inverse(multiply(inverse(multiply(Y,inverse(Y))),inverse(inverse(multiply(Z,inverse(Z))))))),X)),
inference('PARAMODULATE',[status(thm)],[158,263,theory(equality)]) ).
cnf(337,plain,
inverse(multiply(multiply(multiply(inverse(multiply(multiply(inverse(multiply(X,inverse(X))),inverse(inverse(multiply(Y,inverse(Y))))),Z)),U),inverse(U)),multiply(V,inverse(V)))) = Z,
inference('PARAMODULATE',[status(thm)],[21,263,theory(equality)]) ).
cnf(340,plain,
inverse(inverse(inverse(inverse(inverse(multiply(X,inverse(X))))))) = multiply(Y,inverse(Y)),
inference('PARAMODULATE',[status(thm)],[157,161,theory(equality)]) ).
cnf(349,plain,
inverse(multiply(multiply(inverse(multiply(X,inverse(X))),Y),inverse(Y))) = multiply(inverse(inverse(inverse(multiply(multiply(Z,inverse(Z)),U)))),U),
inference('PARAMODULATE',[status(thm)],[86,157,theory(equality)]) ).
cnf(605,plain,
inverse(inverse(inverse(inverse(X)))) = X,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[157,340,theory(equality)]),222,theory(equality)]) ).
cnf(636,plain,
inverse(X) = inverse(multiply(inverse(multiply(Y,inverse(Y))),X)),
inference('REWRITE',[status(thm)],[222,605,theory(equality)]) ).
cnf(649,plain,
inverse(X) = inverse(multiply(multiply(Y,inverse(Y)),X)),
inference('REWRITE',[status(thm)],[314,605,636,theory(equality)]) ).
cnf(706,plain,
inverse(multiply(multiply(multiply(inverse(multiply(multiply(multiply(X,inverse(X)),inverse(inverse(multiply(Y,inverse(Y))))),Z)),U),inverse(U)),multiply(V,inverse(V)))) = Z,
inference('REWRITE',[status(thm)],[149,649,theory(equality)]) ).
cnf(708,plain,
inverse(multiply(multiply(multiply(multiply(X,inverse(X)),inverse(inverse(multiply(Y,inverse(Y))))),Z),multiply(U,inverse(U)))) = inverse(Z),
inference('REWRITE',[status(thm)],[287,649,theory(equality)]) ).
cnf(714,plain,
inverse(multiply(multiply(inverse(multiply(X,inverse(X))),Y),inverse(Y))) = multiply(inverse(inverse(inverse(Z))),Z),
inference('REWRITE',[status(thm)],[349,649,theory(equality)]) ).
cnf(736,plain,
inverse(multiply(multiply(multiply(inverse(X),Y),inverse(Y)),multiply(Z,inverse(Z)))) = X,
inference('REWRITE',[status(thm)],[21,649,theory(equality)]) ).
cnf(737,plain,
multiply(multiply(multiply(X,inverse(X)),inverse(inverse(multiply(Y,inverse(Y))))),Z) = Z,
inference('REWRITE',[status(thm)],[706,736,theory(equality)]) ).
cnf(738,plain,
inverse(multiply(X,multiply(Y,inverse(Y)))) = inverse(X),
inference('REWRITE',[status(thm)],[708,737,theory(equality)]) ).
cnf(739,plain,
inverse(multiply(multiply(inverse(X),Y),inverse(Y))) = X,
inference('REWRITE',[status(thm)],[736,738,theory(equality)]) ).
cnf(741,plain,
inverse(multiply(multiply(inverse(multiply(X,inverse(X))),Y),Z)) = inverse(multiply(Y,Z)),
inference('REWRITE',[status(thm)],[185,738,739,theory(equality)]) ).
cnf(752,plain,
multiply(X,inverse(X)) = multiply(inverse(inverse(inverse(Y))),Y),
inference('REWRITE',[status(thm)],[714,739,theory(equality)]) ).
cnf(828,plain,
multiply(multiply(inverse(multiply(X,inverse(X))),inverse(inverse(multiply(Y,inverse(Y))))),Z) = Z,
inference('REWRITE',[status(thm)],[337,736,theory(equality)]) ).
cnf(830,plain,
multiply(multiply(multiply(inverse(inverse(multiply(X,inverse(X)))),Y),inverse(Y)),Z) = Z,
inference('REWRITE',[status(thm)],[255,736,theory(equality)]) ).
cnf(832,plain,
multiply(inverse(multiply(X,inverse(X))),Y) = Y,
inference('REWRITE',[status(thm)],[202,741,736,theory(equality)]) ).
cnf(842,plain,
multiply(inverse(inverse(multiply(X,inverse(X)))),Y) = Y,
inference('REWRITE',[status(thm)],[828,832,theory(equality)]) ).
cnf(850,plain,
multiply(multiply(X,inverse(X)),Y) = Y,
inference('REWRITE',[status(thm)],[830,842,theory(equality)]) ).
cnf(865,plain,
inverse(multiply(X,inverse(multiply(Y,inverse(Y))))) = inverse(X),
inference('REWRITE',[status(thm)],[261,850,theory(equality)]) ).
cnf(890,plain,
inverse(inverse(X)) = X,
inference('REWRITE',[status(thm)],[73,865,738,649,theory(equality)]) ).
cnf(899,plain,
multiply(X,inverse(X)) = multiply(inverse(Y),Y),
inference('REWRITE',[status(thm)],[752,890,theory(equality)]) ).
cnf(919,plain,
multiply(inverse(X),X) = multiply(inverse(Y),Y),
inference('PARAMODULATE',[status(thm)],[899,899,theory(equality)]) ).
cnf(920,plain,
$false,
inference('REWRITE',[status(thm)],[prove_these_axioms_1,919,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : GRP433-1 : TPTP v8.1.0. Released v2.6.0.
% 0.06/0.12 % Command : run-snark %s %d
% 0.13/0.33 % Computer : n010.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Mon Jun 13 15:21:54 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.20/0.44 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.45 *
% 0.20/0.45 *
% 0.20/0.46 #<PACKAGE "SNARK-USER">
% 0.20/0.46 *
% 0.20/0.46 SNARK-TPTP-OPTIONS
% 0.20/0.46 *
% 0.20/0.46 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.20/0.46 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.20/0.46 (USE-FACTORING :POS)
% 0.20/0.46 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.20/0.46 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.20/0.46 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.20/0.46 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.20/0.46 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.20/0.46 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.20/0.46 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.20/0.46 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.20/0.46 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.20/0.46 (DECLARE-TPTP-SYMBOLS2))
% 0.20/0.46 *
% 0.20/0.46 "."
% 0.20/0.46 *
% 0.20/0.46 ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-13T15:21:54
% 0.20/0.46 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n010.cluster.edu at 2022-06-13T15:21:54
% 0.66/0.82
% 0.66/0.82
% 0.66/0.82 #||
% 0.66/0.82 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.66/0.82 % SZS output start Refutation
% See solution above
% 0.66/0.83 ||#
% 0.66/0.83
% 0.66/0.83 ; Summary of computation:
% 0.66/0.83 ; 2197 formulas have been input or derived (from 24 formulas).
% 0.66/0.83 ; 920 (42%) were retained. Of these,
% 0.66/0.83 ; 851 (92%) were simplified or subsumed later,
% 0.66/0.83 ; 69 ( 8%) are still being kept.
% 0.66/0.83 ;
% 0.66/0.83 ; Run time in seconds excluding printing time:
% 0.66/0.83 ; 0.000 0% Read assertion file (1 call)
% 0.66/0.83 ; 0.001 0% Assert (2 calls)
% 0.66/0.83 ; 0.133 37% Process new row (2,163 calls)
% 0.66/0.83 ; 0.004 1% Resolution (46 calls)
% 0.66/0.83 ; 0.028 8% Paramodulation (23 calls)
% 0.66/0.83 ; 0.080 22% Forward simplification (2,046 calls)
% 0.66/0.83 ; 0.080 22% Backward simplification (920 calls)
% 0.66/0.83 ; 0.006 2% Ordering (3,127 calls)
% 0.66/0.83 ; 0.000 0% Sortal reasoning (32 calls)
% 0.66/0.83 ; 0.000 0% Purity testing (1 call)
% 0.66/0.83 ; 0.030 8% Other
% 0.66/0.83 ; 0.362 Total
% 0.66/0.83 ; 0.368 Real time
% 0.66/0.83 ;
% 0.66/0.83 ; Term-hash-array has 2,694 terms in all.
% 0.66/0.83 ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 0.66/0.83 ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 0.66/0.83 ; Path-index has 239 entries (1,977 at peak, 2,811 added, 2,572 deleted).
% 0.66/0.83 ; Path-index has 6,342 nodes (8,320 at peak, 9,366 added, 3,024 deleted).
% 0.66/0.83 ; Trie-index has 239 entries (1,977 at peak, 2,811 added, 2,572 deleted).
% 0.66/0.83 ; Trie-index has 1,430 nodes (19,380 at peak, 24,639 added, 23,209 deleted).
% 0.66/0.83 ; Retrieved 2,848 generalization terms in 15,491 calls.
% 0.66/0.83 ; Retrieved 1,736 instance terms in 919 calls.
% 0.66/0.83 ; Retrieved 3,177 unifiable terms in 238 calls.
% 0.66/0.83 ;
% 0.66/0.83 ; The agenda of rows to process has 18 entries:
% 0.66/0.83 ; 8 with value 20 2 with value 23 4 with value 28
% 0.66/0.83 ; 2 with value 22 2 with value 26
% 0.66/0.83 ; The agenda of rows to give has 62 entries:
% 0.66/0.83 ; 1 with value (4 19) 1 with value (4 29) 4 with value (4 37)
% 0.66/0.83 ; 2 with value (4 20) 1 with value (4 30) 2 with value (4 38)
% 0.66/0.83 ; 4 with value (4 21) 2 with value (4 31) 3 with value (4 39)
% 0.66/0.83 ; 4 with value (4 22) 1 with value (4 32) 2 with value (4 40)
% 0.66/0.83 ; 2 with value (4 23) 4 with value (4 33) 1 with value (4 41)
% 0.66/0.83 ; 3 with value (4 24) 5 with value (4 34) 1 with value (4 43)
% 0.66/0.83 ; 5 with value (4 26) 1 with value (4 35) 2 with value (4 44)
% 0.66/0.83 ; 8 with value (4 27) 1 with value (4 36) 1 with value (4 47)
% 0.66/0.83 ; 1 with value (4 28)
% 0.66/0.83 Evaluation took:
% 0.66/0.83 0.368 seconds of real time
% 0.66/0.83 0.342081 seconds of user run time
% 0.66/0.83 0.02615 seconds of system run time
% 0.66/0.83 [Run times include 0.035 seconds GC run time.]
% 0.66/0.83 0 calls to %EVAL
% 0.66/0.83 0 page faults and
% 0.66/0.83 31,497,032 bytes consed.
% 0.66/0.83 :PROOF-FOUND
% 0.66/0.83 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-13T15:21:55
% 0.66/0.83 :PROOF-FOUND
% 0.66/0.83 *
%------------------------------------------------------------------------------