TSTP Solution File: GRP415-1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : GRP415-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n019.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:25 EDT 2022
% Result : Unsatisfiable 1.84s 2.04s
% Output : Refutation 1.84s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% 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 : 13 ( 4 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 : 44 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
inverse(multiply(X,inverse(multiply(inverse(multiply(inverse(multiply(Y,X)),multiply(Y,inverse(Z)))),inverse(multiply(inverse(X),X)))))) = 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(X,inverse(multiply(inverse(multiply(inverse(multiply(Y,X)),multiply(Y,Z))),inverse(multiply(inverse(X),X)))))) = multiply(U,inverse(multiply(inverse(multiply(inverse(multiply(V,U)),multiply(V,inverse(Z)))),inverse(multiply(inverse(U),U))))),
inference('PARAMODULATE',[status(thm)],[single_axiom,single_axiom,theory(equality)]) ).
cnf(6,plain,
multiply(X,inverse(multiply(inverse(multiply(inverse(multiply(Y,X)),multiply(Y,inverse(inverse(Z))))),inverse(multiply(inverse(X),X))))) = Z,
inference('PARAMODULATE',[status(thm)],[single_axiom,3,theory(equality)]) ).
cnf(24,plain,
inverse(multiply(X,inverse(multiply(inverse(multiply(inverse(multiply(Y,X)),Z)),inverse(multiply(inverse(X),X)))))) = multiply(inverse(multiply(inverse(multiply(U,Y)),multiply(U,inverse(inverse(Z))))),inverse(multiply(inverse(Y),Y))),
inference('PARAMODULATE',[status(thm)],[single_axiom,6,theory(equality)]) ).
cnf(42,plain,
multiply(inverse(multiply(inverse(multiply(X,Y)),multiply(X,inverse(inverse(multiply(Y,inverse(Z))))))),inverse(multiply(inverse(Y),Y))) = Z,
inference('PARAMODULATE',[status(thm)],[single_axiom,24,theory(equality)]) ).
cnf(44,plain,
multiply(X,inverse(inverse(multiply(Y,inverse(multiply(inverse(multiply(inverse(multiply(X,Y)),Z)),inverse(multiply(inverse(Y),Y)))))))) = Z,
inference('PARAMODULATE',[status(thm)],[6,24,theory(equality)]) ).
cnf(102,plain,
multiply(inverse(multiply(inverse(multiply(X,inverse(multiply(inverse(multiply(Y,Z)),multiply(Y,inverse(inverse(multiply(Z,inverse(U))))))))),multiply(X,inverse(inverse(U))))),inverse(multiply(inverse(inverse(multiply(inverse(multiply(Y,Z)),multiply(Y,inverse(inverse(multiply(Z,inverse(U)))))))),inverse(multiply(inverse(multiply(Y,Z)),multiply(Y,inverse(inverse(multiply(Z,inverse(U)))))))))) = multiply(inverse(Z),Z),
inference('PARAMODULATE',[status(thm)],[42,42,theory(equality)]) ).
cnf(112,plain,
inverse(multiply(inverse(multiply(inverse(X),X)),inverse(multiply(inverse(multiply(inverse(Y),Z)),inverse(multiply(inverse(inverse(multiply(inverse(X),X))),inverse(multiply(inverse(X),X)))))))) = multiply(inverse(multiply(inverse(multiply(U,inverse(multiply(inverse(multiply(V,X)),multiply(V,inverse(inverse(multiply(X,inverse(Y))))))))),multiply(U,inverse(inverse(Z))))),inverse(multiply(inverse(inverse(multiply(inverse(multiply(V,X)),multiply(V,inverse(inverse(multiply(X,inverse(Y)))))))),inverse(multiply(inverse(multiply(V,X)),multiply(V,inverse(inverse(multiply(X,inverse(Y)))))))))),
inference('PARAMODULATE',[status(thm)],[24,42,theory(equality)]) ).
cnf(113,plain,
inverse(multiply(inverse(multiply(inverse(X),X)),inverse(multiply(inverse(multiply(inverse(Y),Y)),inverse(multiply(inverse(inverse(multiply(inverse(X),X))),inverse(multiply(inverse(X),X)))))))) = multiply(inverse(X),X),
inference('REWRITE',[status(thm)],[102,112,theory(equality)]) ).
cnf(151,plain,
multiply(X,inverse(inverse(multiply(Y,inverse(multiply(inverse(Z),inverse(multiply(inverse(Y),Y)))))))) = inverse(inverse(multiply(U,inverse(multiply(inverse(multiply(inverse(multiply(inverse(multiply(X,Y)),U)),Z)),inverse(multiply(inverse(U),U))))))),
inference('PARAMODULATE',[status(thm)],[44,44,theory(equality)]) ).
cnf(848,plain,
multiply(inverse(multiply(X,Y)),multiply(X,inverse(inverse(multiply(Y,inverse(multiply(inverse(Z),inverse(multiply(inverse(Y),Y))))))))) = Z,
inference('PARAMODULATE',[status(thm)],[44,151,theory(equality)]) ).
cnf(1019,plain,
multiply(inverse(multiply(X,inverse(multiply(inverse(Y),Y)))),multiply(X,inverse(multiply(inverse(Y),Y)))) = multiply(inverse(Z),Z),
inference('PARAMODULATE',[status(thm)],[848,113,theory(equality)]) ).
cnf(1173,plain,
multiply(inverse(X),X) = multiply(inverse(Y),Y),
inference('PARAMODULATE',[status(thm)],[1019,1019,theory(equality)]) ).
cnf(1174,plain,
$false,
inference('REWRITE',[status(thm)],[prove_these_axioms_1,1173,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : GRP415-1 : TPTP v8.1.0. Released v2.6.0.
% 0.11/0.13 % Command : run-snark %s %d
% 0.13/0.34 % Computer : n019.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 : Mon Jun 13 06:51:09 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.45 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.46 *
% 0.19/0.46 *
% 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.47 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.19/0.47 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.19/0.47 (USE-FACTORING :POS)
% 0.19/0.47 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.19/0.47 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.19/0.47 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.19/0.47 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.19/0.47 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.19/0.47 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.19/0.47 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.19/0.47 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.19/0.47 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.19/0.47 (DECLARE-TPTP-SYMBOLS2))
% 0.19/0.47 *
% 0.19/0.47 "."
% 0.19/0.47 *
% 0.19/0.47 ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-13T06:51:10
% 0.19/0.47 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n019.cluster.edu at 2022-06-13T06:51:10
% 1.84/2.04
% 1.84/2.04
% 1.84/2.04 #||
% 1.84/2.04 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.84/2.04 % SZS output start Refutation
% See solution above
% 1.84/2.05 ||#
% 1.84/2.05
% 1.84/2.05 ; Summary of computation:
% 1.84/2.05 ; 4280 formulas have been input or derived (from 27 formulas).
% 1.84/2.05 ; 1174 (27%) were retained. Of these,
% 1.84/2.05 ; 113 (10%) were simplified or subsumed later,
% 1.84/2.05 ; 1061 (90%) are still being kept.
% 1.84/2.05 ;
% 1.84/2.05 ; Run time in seconds excluding printing time:
% 1.84/2.05 ; 0.001 0% Read assertion file (1 call)
% 1.84/2.05 ; 0.001 0% Assert (2 calls)
% 1.84/2.05 ; 0.496 32% Process new row (3,936 calls)
% 1.84/2.05 ; 0.005 0% Resolution (52 calls)
% 1.84/2.05 ; 0.135 9% Paramodulation (26 calls)
% 1.84/2.05 ; 0.702 45% Forward simplification (3,929 calls)
% 1.84/2.05 ; 0.089 6% Backward simplification (1,174 calls)
% 1.84/2.05 ; 0.114 7% Ordering (9,859 calls)
% 1.84/2.05 ; 0.001 0% Sortal reasoning (32 calls)
% 1.84/2.05 ; 0.000 0% Purity testing (1 call)
% 1.84/2.05 ; 0.030 2% Other
% 1.84/2.05 ; 1.574 Total
% 1.84/2.05 ; 1.577 Real time
% 1.84/2.05 ;
% 1.84/2.05 ; Term-hash-array has 7,549 terms in all.
% 1.84/2.05 ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 1.84/2.05 ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 1.84/2.05 ; Path-index has 6,792 entries (6,807 at peak, 7,571 added, 779 deleted).
% 1.84/2.05 ; Path-index has 29,722 nodes (31,376 at peak, 31,789 added, 2,067 deleted).
% 1.84/2.05 ; Trie-index has 6,792 entries (6,807 at peak, 7,571 added, 779 deleted).
% 1.84/2.05 ; Trie-index has 109,102 nodes (125,451 at peak, 134,974 added, 25,872 deleted).
% 1.84/2.05 ; Retrieved 8,286 generalization terms in 105,359 calls.
% 1.84/2.05 ; Retrieved 2,615 instance terms in 1,258 calls.
% 1.84/2.05 ; Retrieved 22,403 unifiable terms in 527 calls.
% 1.84/2.05 ;
% 1.84/2.05 ; The agenda of rows to process has 311 entries:
% 1.84/2.05 ; 7 with value 36 7 with value 63 3 with value 83
% 1.84/2.05 ; 2 with value 40 13 with value 64 7 with value 84
% 1.84/2.05 ; 1 with value 43 4 with value 65 2 with value 85
% 1.84/2.05 ; 2 with value 45 5 with value 66 4 with value 86
% 1.84/2.05 ; 4 with value 47 22 with value 67 8 with value 87
% 1.84/2.05 ; 5 with value 48 18 with value 68 4 with value 88
% 1.84/2.05 ; 5 with value 51 7 with value 69 2 with value 91
% 1.84/2.05 ; 2 with value 52 21 with value 70 2 with value 97
% 1.84/2.05 ; 7 with value 53 31 with value 71 1 with value 98
% 1.84/2.05 ; 4 with value 54 14 with value 72 1 with value 102
% 1.84/2.05 ; 9 with value 55 17 with value 73 3 with value 103
% 1.84/2.05 ; 12 with value 56 11 with value 74 1 with value 107
% 1.84/2.05 ; 6 with value 57 5 with value 75 3 with value 108
% 1.84/2.05 ; 2 with value 58 6 with value 76 1 with value 109
% 1.84/2.05 ; 4 with value 59 1 with value 77 2 with value 110
% 1.84/2.05 ; 3 with value 60 4 with value 80 2 with value 111
% 1.84/2.05 ; 2 with value 61 1 with value 82 1 with value 114
% 1.84/2.05 ; The agenda of rows to give has 1037 entries:
% 1.84/2.05 ; 1 with value (4 20) 15 with value (4 86) 22 with value (4 125)
% 1.84/2.05 ; 2 with value (4 41) 14 with value (4 87) 14 with value (4 126)
% 1.84/2.05 ; 3 with value (4 47) 12 with value (4 88) 10 with value (4 127)
% 1.84/2.05 ; 3 with value (4 48) 17 with value (4 89) 17 with value (4 128)
% 1.84/2.05 ; 2 with value (4 49) 14 with value (4 90) 8 with value (4 129)
% 1.84/2.05 ; 3 with value (4 50) 14 with value (4 91) 8 with value (4 130)
% 1.84/2.05 ; 3 with value (4 51) 7 with value (4 92) 2 with value (4 131)
% 1.84/2.05 ; 3 with value (4 53) 14 with value (4 93) 1 with value (4 132)
% 1.84/2.05 ; 2 with value (4 54) 12 with value (4 94) 10 with value (4 133)
% 1.84/2.05 ; 2 with value (4 55) 17 with value (4 95) 4 with value (4 134)
% 1.84/2.05 ; 3 with value (4 56) 7 with value (4 96) 3 with value (4 135)
% 1.84/2.05 ; 8 with value (4 57) 9 with value (4 97) 5 with value (4 136)
% 1.84/2.05 ; 2 with value (4 58) 13 with value (4 98) 1 with value (4 137)
% 1.84/2.05 ; 1 with value (4 59) 13 with value (4 99) 1 with value (4 138)
% 1.84/2.05 ; 4 with value (4 60) 7 with value (4 100) 12 with value (4 139)
% 1.84/2.05 ; 8 with value (4 61) 9 with value (4 101) 5 with value (4 140)
% 1.84/2.05 ; 2 with value (4 62) 15 with value (4 102) 1 with value (4 141)
% 1.84/2.05 ; 4 with value (4 63) 15 with value (4 103) 3 with value (4 142)
% 1.84/2.05 ; 13 with value (4 64) 10 with value (4 104) 2 with value (4 143)
% 1.84/2.05 ; 16 with value (4 65) 12 with value (4 105) 3 with value (4 144)
% 1.84/2.05 ; 7 with value (4 66) 21 with value (4 106) 1 with value (4 146)
% 1.84/2.05 ; 7 with value (4 67) 10 with value (4 107) 2 with value (4 147)
% 1.84/2.05 ; 8 with value (4 68) 16 with value (4 108) 1 with value (4 149)
% 1.84/2.05 ; 10 with value (4 69) 21 with value (4 109) 3 with value (4 150)
% 1.84/2.05 ; 7 with value (4 70) 21 with value (4 110) 3 with value (4 152)
% 1.84/2.05 ; 9 with value (4 71) 29 with value (4 111) 1 with value (4 153)
% 1.84/2.05 ; 7 with value (4 72) 21 with value (4 112) 4 with value (4 155)
% 1.84/2.05 ; 11 with value (4 73) 18 with value (4 113) 1 with value (4 156)
% 1.84/2.05 ; 8 with value (4 74) 29 with value (4 114) 1 with value (4 158)
% 1.84/2.05 ; 5 with value (4 75) 21 with value (4 115) 1 with value (4 159)
% 1.84/2.05 ; 8 with value (4 76) 13 with value (4 116) 1 with value (4 165)
% 1.84/2.05 ; 14 with value (4 77) 13 with value (4 117) 1 with value (4 166)
% 1.84/2.05 ; 10 with value (4 78) 20 with value (4 118) 1 with value (4 175)
% 1.84/2.05 ; 9 with value (4 79) 31 with value (4 119) 1 with value (4 176)
% 1.84/2.05 ; 5 with value (4 80) 19 with value (4 120) 1 with value (4 184)
% 1.84/2.05 ; 8 with value (4 81) 10 with value (4 121) 2 with value (4 185)
% 1.84/2.05 ; 8 with value (4 82) 21 with value (4 122) 1 with value (4 186)
% 1.84/2.05 ; 6 with value (4 83) 19 with value (4 123) 2 with value (4 191)
% 1.84/2.05 ; 18 with value (4 84) 15 with value (4 124) 1 with value (4 192)
% 1.84/2.05 ; 12 with value (4 85)
% 1.84/2.05 Evaluation took:
% 1.84/2.05 1.578 seconds of real time
% 1.84/2.05 1.488778 seconds of user run time
% 1.84/2.05 0.089135 seconds of system run time
% 1.84/2.05 [Run times include 0.183 seconds GC run time.]
% 1.84/2.05 0 calls to %EVAL
% 1.84/2.05 0 page faults and
% 1.84/2.05 111,090,840 bytes consed.
% 1.84/2.05 :PROOF-FOUND
% 1.84/2.05 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-13T06:51:11
% 1.84/2.05 :PROOF-FOUND
% 1.84/2.05 *
%------------------------------------------------------------------------------