TSTP Solution File: GRP412-1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : GRP412-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n020.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:24 EDT 2022
% Result : Unsatisfiable 0.78s 0.95s
% Output : Refutation 0.78s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 2
% Syntax : Number of clauses : 20 ( 20 unt; 0 nHn; 2 RR)
% Number of literals : 20 ( 19 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 : 63 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
multiply(X,inverse(multiply(multiply(multiply(inverse(Y),Y),inverse(multiply(inverse(multiply(X,inverse(Y))),Z))),Y))) = 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,
multiply(X,inverse(multiply(multiply(multiply(inverse(Y),Y),inverse(Z)),Y))) = inverse(multiply(multiply(multiply(inverse(U),U),inverse(multiply(inverse(multiply(inverse(multiply(X,inverse(Y))),inverse(U))),Z))),U)),
inference('PARAMODULATE',[status(thm)],[single_axiom,single_axiom,theory(equality)]) ).
cnf(5,plain,
multiply(inverse(multiply(X,inverse(Y))),multiply(X,inverse(multiply(multiply(multiply(inverse(Y),Y),inverse(Z)),Y)))) = Z,
inference('PARAMODULATE',[status(thm)],[single_axiom,3,theory(equality)]) ).
cnf(6,plain,
inverse(multiply(multiply(multiply(inverse(X),X),inverse(multiply(inverse(multiply(inverse(multiply(Y,inverse(Z))),inverse(X))),multiply(inverse(multiply(Y,inverse(Z))),U)))),X)) = U,
inference('PARAMODULATE',[status(thm)],[single_axiom,3,theory(equality)]) ).
cnf(24,plain,
multiply(inverse(multiply(X,inverse(Y))),multiply(X,inverse(multiply(Z,Y)))) = multiply(multiply(multiply(inverse(U),U),inverse(multiply(inverse(multiply(multiply(inverse(Y),Y),inverse(U))),Z))),U),
inference('PARAMODULATE',[status(thm)],[5,single_axiom,theory(equality)]) ).
cnf(32,plain,
inverse(multiply(multiply(multiply(inverse(X),X),inverse(multiply(inverse(multiply(Y,inverse(X))),multiply(Y,Z)))),X)) = Z,
inference('PARAMODULATE',[status(thm)],[6,6,theory(equality)]) ).
cnf(33,plain,
multiply(inverse(multiply(X,inverse(Y))),multiply(X,Z)) = multiply(inverse(multiply(U,inverse(Y))),multiply(U,Z)),
inference('PARAMODULATE',[status(thm)],[5,32,theory(equality)]) ).
cnf(52,plain,
multiply(inverse(multiply(X,Y)),multiply(X,Z)) = multiply(inverse(multiply(U,Y)),multiply(U,Z)),
inference('PARAMODULATE',[status(thm)],[33,32,theory(equality)]) ).
cnf(244,plain,
multiply(multiply(inverse(X),X),inverse(multiply(inverse(multiply(Y,inverse(X))),multiply(Y,inverse(multiply(Z,X)))))) = Z,
inference('PARAMODULATE',[status(thm)],[single_axiom,24,theory(equality)]) ).
cnf(245,plain,
inverse(multiply(inverse(multiply(X,inverse(Y))),multiply(X,inverse(multiply(multiply(multiply(inverse(Y),Y),Z),Y))))) = Z,
inference('PARAMODULATE',[status(thm)],[32,24,theory(equality)]) ).
cnf(246,plain,
multiply(multiply(multiply(inverse(X),X),inverse(multiply(inverse(multiply(multiply(inverse(Y),Y),inverse(X))),multiply(multiply(inverse(Y),Y),inverse(Z))))),X) = Z,
inference('PARAMODULATE',[status(thm)],[5,24,theory(equality)]) ).
cnf(324,plain,
multiply(multiply(inverse(multiply(X,Y)),multiply(X,Y)),inverse(multiply(inverse(multiply(Z,inverse(multiply(U,Y)))),multiply(Z,inverse(multiply(V,multiply(U,Y))))))) = V,
inference('PARAMODULATE',[status(thm)],[244,52,theory(equality)]) ).
cnf(446,plain,
multiply(multiply(multiply(inverse(X),X),inverse(multiply(inverse(multiply(Y,inverse(X))),multiply(Y,inverse(Z))))),X) = Z,
inference('PARAMODULATE',[status(thm)],[246,52,theory(equality)]) ).
cnf(538,plain,
multiply(multiply(inverse(multiply(X,Y)),multiply(X,Y)),Z) = multiply(multiply(inverse(multiply(U,Y)),multiply(U,Y)),Z),
inference('PARAMODULATE',[status(thm)],[324,245,theory(equality)]) ).
cnf(540,plain,
multiply(multiply(inverse(X),X),Y) = multiply(multiply(inverse(multiply(Z,U)),multiply(Z,U)),Y),
inference('PARAMODULATE',[status(thm)],[538,446,theory(equality)]) ).
cnf(541,plain,
multiply(multiply(inverse(X),X),Y) = multiply(multiply(inverse(Z),Z),Y),
inference('PARAMODULATE',[status(thm)],[540,540,theory(equality)]) ).
cnf(542,plain,
multiply(multiply(inverse(X),X),inverse(multiply(inverse(multiply(Y,inverse(Z))),multiply(Y,inverse(multiply(U,Z)))))) = U,
inference('PARAMODULATE',[status(thm)],[244,541,theory(equality)]) ).
cnf(565,plain,
multiply(inverse(X),X) = multiply(inverse(Y),Y),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[542,541,theory(equality)]),542,theory(equality)]) ).
cnf(566,plain,
$false,
inference('REWRITE',[status(thm)],[prove_these_axioms_1,565,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GRP412-1 : TPTP v8.1.0. Released v2.6.0.
% 0.12/0.12 % Command : run-snark %s %d
% 0.12/0.33 % Computer : n020.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.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Tue Jun 14 06:25:05 EDT 2022
% 0.12/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.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.48 ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-14T06:25:05
% 0.19/0.48 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n020.cluster.edu at 2022-06-14T06:25:05
% 0.78/0.95
% 0.78/0.95
% 0.78/0.95 #||
% 0.78/0.95 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.78/0.95 % SZS output start Refutation
% See solution above
% 0.78/0.95 ||#
% 0.78/0.95
% 0.78/0.95 ; Summary of computation:
% 0.78/0.95 ; 2149 formulas have been input or derived (from 24 formulas).
% 0.78/0.95 ; 566 (26%) were retained. Of these,
% 0.78/0.95 ; 49 ( 9%) were simplified or subsumed later,
% 0.78/0.95 ; 517 (91%) are still being kept.
% 0.78/0.95 ;
% 0.78/0.95 ; Run time in seconds excluding printing time:
% 0.78/0.95 ; 0.001 0% Read assertion file (1 call)
% 0.78/0.95 ; 0.000 0% Assert (2 calls)
% 0.78/0.95 ; 0.184 39% Process new row (2,081 calls)
% 0.78/0.95 ; 0.001 0% Resolution (46 calls)
% 0.78/0.95 ; 0.063 13% Paramodulation (23 calls)
% 0.78/0.95 ; 0.136 29% Forward simplification (1,371 calls)
% 0.78/0.95 ; 0.027 6% Backward simplification (566 calls)
% 0.78/0.95 ; 0.025 5% Ordering (3,591 calls)
% 0.78/0.95 ; 0.001 0% Sortal reasoning (32 calls)
% 0.78/0.95 ; 0.000 0% Purity testing (1 call)
% 0.78/0.95 ; 0.033 7% Other
% 0.78/0.95 ; 0.471 Total
% 0.78/0.95 ; 0.473 Real time
% 0.78/0.95 ;
% 0.78/0.95 ; Term-hash-array has 4,806 terms in all.
% 0.78/0.95 ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 0.78/0.95 ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 0.78/0.95 ; Path-index has 4,530 entries (4,592 at peak, 4,825 added, 295 deleted).
% 0.78/0.95 ; Path-index has 11,649 nodes (11,680 at peak, 11,767 added, 118 deleted).
% 0.78/0.95 ; Trie-index has 4,530 entries (4,592 at peak, 4,825 added, 295 deleted).
% 0.78/0.95 ; Trie-index has 33,028 nodes (33,354 at peak, 34,724 added, 1,696 deleted).
% 0.78/0.95 ; Retrieved 2,405 generalization terms in 17,940 calls.
% 0.78/0.95 ; Retrieved 1,378 instance terms in 609 calls.
% 0.78/0.95 ; Retrieved 17,446 unifiable terms in 320 calls.
% 0.78/0.95 ;
% 0.78/0.95 ; The agenda of rows to process has 52 entries:
% 0.78/0.95 ; 1 with value 46 3 with value 53 3 with value 60
% 0.78/0.95 ; 1 with value 48 2 with value 55 10 with value 61
% 0.78/0.95 ; 2 with value 49 1 with value 56 6 with value 62
% 0.78/0.95 ; 6 with value 50 2 with value 58 2 with value 64
% 0.78/0.95 ; 6 with value 52 7 with value 59
% 0.78/0.95 ; The agenda of rows to give has 508 entries:
% 0.78/0.95 ; 1 with value (4 23) 23 with value (4 60) 2 with value (4 82)
% 0.78/0.95 ; 2 with value (4 38) 28 with value (4 61) 3 with value (4 83)
% 0.78/0.95 ; 3 with value (4 39) 26 with value (4 62) 2 with value (4 84)
% 0.78/0.95 ; 1 with value (4 40) 32 with value (4 63) 3 with value (4 85)
% 0.78/0.95 ; 1 with value (4 42) 12 with value (4 64) 2 with value (4 86)
% 0.78/0.95 ; 2 with value (4 43) 10 with value (4 65) 2 with value (4 87)
% 0.78/0.95 ; 6 with value (4 44) 13 with value (4 66) 2 with value (4 88)
% 0.78/0.95 ; 3 with value (4 45) 9 with value (4 67) 1 with value (4 90)
% 0.78/0.95 ; 6 with value (4 46) 13 with value (4 68) 1 with value (4 92)
% 0.78/0.95 ; 5 with value (4 47) 19 with value (4 69) 3 with value (4 93)
% 0.78/0.95 ; 5 with value (4 48) 15 with value (4 70) 3 with value (4 94)
% 0.78/0.95 ; 8 with value (4 49) 10 with value (4 71) 2 with value (4 95)
% 0.78/0.95 ; 14 with value (4 50) 13 with value (4 72) 2 with value (4 96)
% 0.78/0.95 ; 10 with value (4 51) 13 with value (4 73) 3 with value (4 97)
% 0.78/0.95 ; 7 with value (4 52) 8 with value (4 74) 1 with value (4 98)
% 0.78/0.95 ; 5 with value (4 53) 7 with value (4 75) 1 with value (4 99)
% 0.78/0.95 ; 9 with value (4 54) 8 with value (4 76) 1 with value (4 101)
% 0.78/0.95 ; 15 with value (4 55) 5 with value (4 77) 1 with value (4 104)
% 0.78/0.95 ; 21 with value (4 56) 5 with value (4 78) 1 with value (4 105)
% 0.78/0.95 ; 19 with value (4 57) 3 with value (4 79) 1 with value (4 107)
% 0.78/0.95 ; 24 with value (4 58) 8 with value (4 80) 1 with value (4 108)
% 0.78/0.95 ; 17 with value (4 59) 6 with value (4 81)
% 0.78/0.95 Evaluation took:
% 0.78/0.95 0.473 seconds of real time
% 0.78/0.95 0.439367 seconds of user run time
% 0.78/0.95 0.034137 seconds of system run time
% 0.78/0.95 [Run times include 0.035 seconds GC run time.]
% 0.78/0.95 0 calls to %EVAL
% 0.78/0.95 0 page faults and
% 0.78/0.95 30,966,072 bytes consed.
% 0.78/0.95 :PROOF-FOUND
% 0.78/0.95 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-14T06:25:05
% 0.78/0.95 :PROOF-FOUND
% 0.78/0.95 *
%------------------------------------------------------------------------------