TSTP Solution File: GRP406-1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : GRP406-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n007.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:08 EDT 2022
% Result : Unsatisfiable 0.89s 1.08s
% Output : Refutation 0.93s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 2
% Syntax : Number of clauses : 15 ( 15 unt; 0 nHn; 2 RR)
% Number of literals : 15 ( 14 equ; 1 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 11 ( 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 : 52 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
multiply(X,inverse(multiply(inverse(multiply(inverse(multiply(X,Y)),Z)),multiply(inverse(Y),multiply(inverse(Y),Y))))) = Z,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',single_axiom) ).
cnf(prove_these_axioms_1,negated_conjecture,
multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_these_axioms_1) ).
cnf(3,plain,
multiply(X,inverse(multiply(inverse(Y),multiply(inverse(Z),multiply(inverse(Z),Z))))) = inverse(multiply(inverse(multiply(inverse(multiply(inverse(multiply(X,Z)),U)),Y)),multiply(inverse(U),multiply(inverse(U),U)))),
inference('PARAMODULATE',[status(thm)],[single_axiom,single_axiom,theory(equality)]) ).
cnf(5,plain,
multiply(inverse(multiply(X,Y)),multiply(X,inverse(multiply(inverse(Z),multiply(inverse(Y),multiply(inverse(Y),Y)))))) = Z,
inference('PARAMODULATE',[status(thm)],[single_axiom,3,theory(equality)]) ).
cnf(6,plain,
inverse(multiply(inverse(multiply(inverse(multiply(inverse(multiply(X,Y)),Z)),multiply(inverse(multiply(X,Y)),U))),multiply(inverse(Z),multiply(inverse(Z),Z)))) = U,
inference('PARAMODULATE',[status(thm)],[single_axiom,3,theory(equality)]) ).
cnf(35,plain,
inverse(multiply(inverse(multiply(inverse(multiply(X,Y)),multiply(X,Z))),multiply(inverse(Y),multiply(inverse(Y),Y)))) = Z,
inference('PARAMODULATE',[status(thm)],[6,6,theory(equality)]) ).
cnf(36,plain,
multiply(inverse(multiply(X,Y)),multiply(X,Z)) = multiply(inverse(multiply(U,Y)),multiply(U,Z)),
inference('PARAMODULATE',[status(thm)],[5,35,theory(equality)]) ).
cnf(59,plain,
multiply(inverse(multiply(X,Y)),multiply(X,inverse(multiply(inverse(multiply(Z,U)),multiply(Z,multiply(inverse(Y),Y)))))) = multiply(inverse(Y),U),
inference('PARAMODULATE',[status(thm)],[5,36,theory(equality)]) ).
cnf(61,plain,
multiply(inverse(multiply(inverse(multiply(X,Y)),Z)),multiply(inverse(multiply(U,Y)),multiply(U,V))) = multiply(inverse(multiply(W,Z)),multiply(W,multiply(X,V))),
inference('PARAMODULATE',[status(thm)],[36,36,theory(equality)]) ).
cnf(62,plain,
multiply(X,multiply(inverse(multiply(inverse(multiply(Y,Z)),multiply(Y,X))),U)) = multiply(inverse(multiply(V,multiply(inverse(Z),multiply(inverse(Z),Z)))),multiply(V,U)),
inference('PARAMODULATE',[status(thm)],[36,35,theory(equality)]) ).
cnf(277,plain,
multiply(inverse(multiply(X,multiply(Y,multiply(Z,U)))),multiply(X,inverse(multiply(inverse(multiply(V,W)),multiply(V,multiply(inverse(multiply(inverse(multiply(Z,X1)),multiply(Z,U))),multiply(inverse(multiply(Y1,X1)),multiply(Y1,U)))))))) = multiply(inverse(multiply(Y,multiply(Z,U))),W),
inference('PARAMODULATE',[status(thm)],[59,61,theory(equality)]) ).
cnf(587,plain,
multiply(inverse(multiply(inverse(multiply(X,Y)),multiply(X,inverse(Z)))),multiply(inverse(Y),multiply(inverse(Y),Y))) = Z,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[5,62,theory(equality)]),277,theory(equality)]) ).
cnf(629,plain,
multiply(inverse(X),X) = multiply(inverse(multiply(Y,multiply(inverse(Z),multiply(inverse(Z),Z)))),multiply(Y,multiply(inverse(Z),multiply(inverse(Z),Z)))),
inference('PARAMODULATE',[status(thm)],[62,587,theory(equality)]) ).
cnf(677,plain,
multiply(inverse(X),X) = multiply(inverse(Y),Y),
inference('PARAMODULATE',[status(thm)],[629,629,theory(equality)]) ).
cnf(678,plain,
$false,
inference('REWRITE',[status(thm)],[prove_these_axioms_1,677,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP406-1 : TPTP v8.1.0. Released v2.6.0.
% 0.03/0.13 % Command : run-snark %s %d
% 0.14/0.34 % Computer : n007.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 : Tue Jun 14 01:31:54 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.21/0.46 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.47 *
% 0.21/0.47 *
% 0.21/0.47 #<PACKAGE "SNARK-USER">
% 0.21/0.47 *
% 0.21/0.47 SNARK-TPTP-OPTIONS
% 0.21/0.47 *
% 0.21/0.47 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.21/0.47 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.21/0.47 (USE-FACTORING :POS)
% 0.21/0.47 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.21/0.47 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.21/0.47 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.21/0.47 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.21/0.47 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.21/0.47 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.21/0.47 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.21/0.47 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.21/0.47 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.21/0.47 (DECLARE-TPTP-SYMBOLS2))
% 0.21/0.47 *
% 0.21/0.47 "."
% 0.21/0.47 *
% 0.21/0.47 ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-14T01:31:54
% 0.21/0.47 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n007.cluster.edu at 2022-06-14T01:31:54
% 0.89/1.08
% 0.89/1.08
% 0.89/1.08 #||
% 0.89/1.08 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.89/1.08 % SZS output start Refutation
% See solution above
% 0.93/1.09 ||#
% 0.93/1.09
% 0.93/1.09 ; Summary of computation:
% 0.93/1.09 ; 2350 formulas have been input or derived (from 20 formulas).
% 0.93/1.09 ; 678 (29%) were retained. Of these,
% 0.93/1.09 ; 12 ( 2%) were simplified or subsumed later,
% 0.93/1.09 ; 666 (98%) are still being kept.
% 0.93/1.09 ;
% 0.93/1.09 ; Run time in seconds excluding printing time:
% 0.93/1.09 ; 0.001 0% Read assertion file (1 call)
% 0.93/1.09 ; 0.000 0% Assert (2 calls)
% 0.93/1.09 ; 0.193 32% Process new row (2,093 calls)
% 0.93/1.09 ; 0.000 0% Resolution (38 calls)
% 0.93/1.09 ; 0.087 14% Paramodulation (19 calls)
% 0.93/1.09 ; 0.226 37% Forward simplification (1,712 calls)
% 0.93/1.09 ; 0.036 6% Backward simplification (678 calls)
% 0.93/1.09 ; 0.032 5% Ordering (4,619 calls)
% 0.93/1.09 ; 0.000 0% Sortal reasoning (32 calls)
% 0.93/1.09 ; 0.001 0% Purity testing (1 call)
% 0.93/1.09 ; 0.027 4% Other
% 0.93/1.09 ; 0.603 Total
% 0.93/1.09 ; 0.620 Real time
% 0.93/1.09 ;
% 0.93/1.09 ; Term-hash-array has 5,600 terms in all.
% 0.93/1.09 ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 0.93/1.09 ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 0.93/1.09 ; Path-index has 5,532 entries (5,541 at peak, 5,611 added, 79 deleted).
% 0.93/1.09 ; Path-index has 6,500 nodes (6,512 at peak, 6,574 added, 74 deleted).
% 0.93/1.09 ; Trie-index has 5,532 entries (5,541 at peak, 5,611 added, 79 deleted).
% 0.93/1.09 ; Trie-index has 38,345 nodes (38,381 at peak, 39,014 added, 669 deleted).
% 0.93/1.09 ; Retrieved 4,014 generalization terms in 22,808 calls.
% 0.93/1.09 ; Retrieved 2,388 instance terms in 753 calls.
% 0.93/1.09 ; Retrieved 33,667 unifiable terms in 271 calls.
% 0.93/1.09 ;
% 0.93/1.09 ; The agenda of rows to process has 230 entries:
% 0.93/1.09 ; 1 with value 20 17 with value 56 3 with value 72
% 0.93/1.09 ; 2 with value 38 10 with value 57 1 with value 73
% 0.93/1.09 ; 3 with value 39 7 with value 58 4 with value 74
% 0.93/1.09 ; 8 with value 40 4 with value 59 3 with value 75
% 0.93/1.09 ; 4 with value 44 20 with value 60 1 with value 76
% 0.93/1.09 ; 2 with value 45 16 with value 61 2 with value 78
% 0.93/1.09 ; 9 with value 46 9 with value 62 2 with value 79
% 0.93/1.09 ; 2 with value 47 13 with value 63 1 with value 82
% 0.93/1.09 ; 4 with value 48 5 with value 64 3 with value 85
% 0.93/1.09 ; 4 with value 49 2 with value 65 4 with value 86
% 0.93/1.09 ; 1 with value 50 5 with value 66 1 with value 87
% 0.93/1.09 ; 7 with value 51 2 with value 67 1 with value 89
% 0.93/1.09 ; 5 with value 52 2 with value 68 1 with value 90
% 0.93/1.09 ; 9 with value 53 1 with value 69 2 with value 104
% 0.93/1.09 ; 8 with value 54 4 with value 70 2 with value 124
% 0.93/1.09 ; 12 with value 55 1 with value 71
% 0.93/1.09 ; The agenda of rows to give has 651 entries:
% 0.93/1.09 ; 1 with value (4 20) 36 with value (4 60) 9 with value (4 81)
% 0.93/1.09 ; 1 with value (4 40) 39 with value (4 61) 5 with value (4 82)
% 0.93/1.09 ; 2 with value (4 41) 41 with value (4 62) 2 with value (4 83)
% 0.93/1.09 ; 5 with value (4 42) 37 with value (4 63) 5 with value (4 84)
% 0.93/1.09 ; 4 with value (4 43) 24 with value (4 64) 1 with value (4 86)
% 0.93/1.09 ; 7 with value (4 44) 15 with value (4 65) 4 with value (4 87)
% 0.93/1.09 ; 8 with value (4 45) 15 with value (4 66) 1 with value (4 88)
% 0.93/1.09 ; 5 with value (4 46) 16 with value (4 67) 1 with value (4 89)
% 0.93/1.09 ; 6 with value (4 47) 8 with value (4 68) 2 with value (4 90)
% 0.93/1.09 ; 6 with value (4 48) 5 with value (4 69) 1 with value (4 91)
% 0.93/1.09 ; 13 with value (4 49) 17 with value (4 70) 1 with value (4 92)
% 0.93/1.09 ; 13 with value (4 50) 14 with value (4 71) 2 with value (4 93)
% 0.93/1.09 ; 16 with value (4 51) 8 with value (4 72) 4 with value (4 94)
% 0.93/1.09 ; 10 with value (4 52) 7 with value (4 73) 1 with value (4 96)
% 0.93/1.09 ; 16 with value (4 53) 6 with value (4 74) 2 with value (4 97)
% 0.93/1.09 ; 9 with value (4 54) 5 with value (4 75) 2 with value (4 98)
% 0.93/1.09 ; 33 with value (4 55) 6 with value (4 76) 1 with value (4 100)
% 0.93/1.09 ; 31 with value (4 56) 4 with value (4 77) 1 with value (4 101)
% 0.93/1.09 ; 42 with value (4 57) 5 with value (4 78) 1 with value (4 104)
% 0.93/1.09 ; 23 with value (4 58) 8 with value (4 79) 1 with value (4 105)
% 0.93/1.09 ; 28 with value (4 59) 8 with value (4 80) 1 with value (4 107)
% 0.93/1.09 Evaluation took:
% 0.93/1.09 0.62 seconds of real time
% 0.93/1.09 0.584341 seconds of user run time
% 0.93/1.09 0.035689 seconds of system run time
% 0.93/1.09 [Run times include 0.041 seconds GC run time.]
% 0.93/1.09 0 calls to %EVAL
% 0.93/1.09 0 page faults and
% 0.93/1.09 38,850,704 bytes consed.
% 0.93/1.09 :PROOF-FOUND
% 0.93/1.09 ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-14T01:31:55
% 0.93/1.09 :PROOF-FOUND
% 0.93/1.09 *
%------------------------------------------------------------------------------