TSTP Solution File: GRP292-1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : GRP292-1 : TPTP v8.1.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n032.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:47 EDT 2022
% Result : Unsatisfiable 11.36s 11.58s
% Output : Refutation 11.36s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 9
% Syntax : Number of clauses : 30 ( 14 unt; 12 nHn; 19 RR)
% Number of literals : 65 ( 64 equ; 27 neg)
% Maximal clause size : 9 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 27 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(left_identity,axiom,
multiply(identity,X) = X,
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-0.ax',left_identity) ).
cnf(left_inverse,axiom,
multiply(inverse(X),X) = identity,
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-0.ax',left_inverse) ).
cnf(associativity,axiom,
multiply(multiply(X,Y),Z) = multiply(X,multiply(Y,Z)),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-0.ax',associativity) ).
cnf(prove_this_1,negated_conjecture,
( multiply(sk_c7,sk_c6) = sk_c5
| multiply(sk_c5,sk_c6) = sk_c7 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_1) ).
cnf(prove_this_14,negated_conjecture,
( multiply(sk_c2,sk_c5) = sk_c6
| multiply(sk_c3,sk_c4) = sk_c6 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_14) ).
cnf(prove_this_15,negated_conjecture,
( multiply(sk_c2,sk_c5) = sk_c6
| inverse(sk_c3) = sk_c4 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_15) ).
cnf(prove_this_18,negated_conjecture,
( inverse(sk_c2) = sk_c5
| multiply(sk_c3,sk_c4) = sk_c6 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_18) ).
cnf(prove_this_19,negated_conjecture,
( inverse(sk_c2) = sk_c5
| inverse(sk_c3) = sk_c4 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_19) ).
cnf(prove_this_21,negated_conjecture,
( multiply(sk_c7,sk_c6) != sk_c5
| multiply(X,sk_c7) != sk_c6
| inverse(X) != sk_c7
| multiply(Y,sk_c5) != sk_c6
| inverse(Y) != sk_c5
| multiply(sk_c5,sk_c6) != sk_c7
| multiply(Z,U) != sk_c6
| inverse(Z) != U
| multiply(U,sk_c5) != sk_c6 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_21) ).
cnf(28,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(29,plain,
multiply(multiply(X,inverse(Y)),Y) = multiply(X,identity),
inference('PARAMODULATE',[status(thm)],[associativity,left_inverse,theory(equality)]) ).
cnf(77,plain,
( multiply(sk_c7,sk_c6) != sk_c5
| multiply(X,sk_c7) != sk_c6
| inverse(X) != sk_c7
| multiply(Y,sk_c5) != sk_c6
| inverse(Y) != sk_c5
| multiply(sk_c5,sk_c6) != sk_c7
| identity != sk_c6
| inverse(inverse(Z)) != Z
| multiply(Z,sk_c5) != sk_c6 ),
inference('PARAMODULATE',[status(thm)],[prove_this_21,left_inverse,theory(equality)]) ).
cnf(118,plain,
X = multiply(inverse(inverse(X)),identity),
inference('PARAMODULATE',[status(thm)],[28,left_inverse,theory(equality)]) ).
cnf(119,plain,
multiply(X,Y) = multiply(inverse(inverse(X)),Y),
inference('PARAMODULATE',[status(thm)],[28,28,theory(equality)]) ).
cnf(120,plain,
X = multiply(X,identity),
inference('REWRITE',[status(thm)],[118,119,theory(equality)]) ).
cnf(122,plain,
multiply(multiply(X,inverse(Y)),Y) = X,
inference('REWRITE',[status(thm)],[29,120,theory(equality)]) ).
cnf(123,plain,
( inverse(sk_c2) = sk_c5
| sk_c4 = multiply(inverse(sk_c3),sk_c6) ),
inference('PARAMODULATE',[status(thm)],[28,prove_this_18,theory(equality)]) ).
cnf(150,plain,
X = inverse(inverse(X)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[122,left_inverse,theory(equality)]),left_identity,theory(equality)]) ).
cnf(152,plain,
( multiply(sk_c7,sk_c6) != sk_c5
| multiply(X,sk_c7) != sk_c6
| inverse(X) != sk_c7
| multiply(Y,sk_c5) != sk_c6
| inverse(Y) != sk_c5
| multiply(sk_c5,sk_c6) != sk_c7
| identity != sk_c6 ),
inference('CONDENSE',[status(thm)],[inference('REWRITE',[status(thm)],[77,150,theory(equality)])]) ).
cnf(162,plain,
multiply(X,inverse(X)) = identity,
inference('PARAMODULATE',[status(thm)],[left_inverse,150,theory(equality)]) ).
cnf(206,plain,
( inverse(sk_c2) = sk_c5
| sk_c4 = multiply(sk_c4,sk_c6) ),
inference('PARAMODULATE',[status(thm)],[123,prove_this_19,theory(equality)]) ).
cnf(212,plain,
( inverse(sk_c2) = sk_c5
| identity = sk_c6 ),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[28,206,theory(equality)]),left_inverse,theory(equality)]) ).
cnf(217,plain,
( identity = sk_c6
| multiply(sk_c2,sk_c5) = identity ),
inference('PARAMODULATE',[status(thm)],[162,212,theory(equality)]) ).
cnf(229,plain,
( identity = sk_c6
| inverse(sk_c3) = sk_c4 ),
inference('PARAMODULATE',[status(thm)],[prove_this_15,217,theory(equality)]) ).
cnf(230,plain,
( identity = sk_c6
| multiply(sk_c3,sk_c4) = sk_c6 ),
inference('PARAMODULATE',[status(thm)],[prove_this_14,217,theory(equality)]) ).
cnf(232,plain,
( identity = sk_c6
| multiply(sk_c3,sk_c4) = identity ),
inference('PARAMODULATE',[status(thm)],[162,229,theory(equality)]) ).
cnf(558,plain,
identity = sk_c6,
inference('PARAMODULATE',[status(thm)],[230,232,theory(equality)]) ).
cnf(559,plain,
sk_c5 = sk_c7,
inference('REWRITE',[status(thm)],[prove_this_1,120,558,theory(equality)]) ).
cnf(639,plain,
( multiply(X,sk_c5) != identity
| inverse(X) != sk_c5 ),
inference('CONDENSE',[status(thm)],[inference('REWRITE',[status(thm)],[152,120,559,558,theory(equality)])]) ).
cnf(675,plain,
$false,
inference('HYPERRESOLVE',[status(thm)],[639,left_inverse,150]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : GRP292-1 : TPTP v8.1.0. Released v2.5.0.
% 0.00/0.11 % Command : run-snark %s %d
% 0.10/0.30 % Computer : n032.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 300
% 0.10/0.30 % WCLimit : 600
% 0.10/0.30 % DateTime : Tue Jun 14 10:37:42 EDT 2022
% 0.10/0.30 % CPUTime :
% 0.15/0.38 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.15/0.39 *
% 0.15/0.39 *
% 0.15/0.39 #<PACKAGE "SNARK-USER">
% 0.15/0.39 *
% 0.15/0.39 SNARK-TPTP-OPTIONS
% 0.15/0.39 *
% 0.15/0.39 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.15/0.39 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.15/0.39 (USE-FACTORING :POS)
% 0.15/0.39 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.15/0.39 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.15/0.39 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.15/0.39 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.15/0.39 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.15/0.39 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.15/0.39 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.15/0.39 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.15/0.39 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.15/0.39 (DECLARE-TPTP-SYMBOLS2))
% 0.15/0.39 *
% 0.15/0.39 "."
% 0.15/0.39 *
% 0.15/0.39 ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-14T10:37:43
% 0.15/0.39 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n032.cluster.edu at 2022-06-14T10:37:43
% 0.15/0.40
% 0.15/0.40 ; Recognized left identity assertion (= (|multiply| |identity| ?X) ?X).
% 0.15/0.40 ; Recognized possible left inverse assertion (= (|multiply| (|inverse| ?X) ?X) |identity|).
% 11.36/11.58 ; Recognized associativity assertion (= (|multiply| (|multiply| ?X ?Y) ?Z) (|multiply| ?X (|multiply| ?Y ?Z))).
% 11.36/11.58
% 11.36/11.58 #||
% 11.36/11.58 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 11.36/11.58 % SZS output start Refutation
% See solution above
% 11.36/11.58 ||#
% 11.36/11.58
% 11.36/11.58 ; Summary of computation:
% 11.36/11.58 ; 98802 formulas have been input or derived (from 113 formulas).
% 11.36/11.58 ; 675 ( 1%) were retained. Of these,
% 11.36/11.58 ; 513 (76%) were simplified or subsumed later,
% 11.36/11.58 ; 162 (24%) are still being kept.
% 11.36/11.58 ;
% 11.36/11.58 ; Run time in seconds excluding printing time:
% 11.36/11.58 ; 0.003 0% Read assertion file (1 call)
% 11.36/11.58 ; 0.000 0% Assert (24 calls)
% 11.36/11.58 ; 0.123 1% Process new row (11,815 calls)
% 11.36/11.58 ; 8.506 76% Resolution (224 calls)
% 11.36/11.58 ; 0.030 0% Paramodulation (112 calls)
% 11.36/11.58 ; 0.000 0% Factoring (93 calls)
% 11.36/11.58 ; 0.043 0% Condensing (10,999 calls)
% 11.36/11.58 ; 1.817 16% Forward subsumption (10,999 calls)
% 11.36/11.58 ; 0.025 0% Backward subsumption (630 calls)
% 11.36/11.58 ; 0.092 1% Clause clause subsumption (17,232 calls)
% 11.36/11.58 ; 0.440 4% Forward simplification (11,568 calls)
% 11.36/11.58 ; 0.023 0% Backward simplification (675 calls)
% 11.36/11.58 ; 0.016 0% Ordering (6,358 calls)
% 11.36/11.58 ; 0.000 0% Sortal reasoning (32 calls)
% 11.36/11.58 ; 0.000 0% Purity testing (1 call)
% 11.36/11.58 ; 0.064 1% Other
% 11.36/11.58 ; 11.182 Total
% 11.36/11.58 ; 11.186 Real time
% 11.36/11.58 ;
% 11.36/11.58 ; Term-hash-array has 601 terms in all.
% 11.36/11.58 ; Feature-vector-row-index has 131 entries (475 at peak, 630 added, 499 deleted).
% 11.36/11.58 ; Feature-vector-row-index has 545 nodes (3,955 at peak, 4,904 added, 4,359 deleted).
% 11.36/11.58 ; Retrieved 196,868 possibly forward subsuming rows in 10,999 calls.
% 11.36/11.58 ; Retrieved 376 possibly backward subsumed rows in 630 calls.
% 11.36/11.58 ; Path-index has 225 entries (487 at peak, 638 added, 413 deleted).
% 11.36/11.58 ; Path-index has 260 nodes (322 at peak, 368 added, 108 deleted).
% 11.36/11.58 ; Trie-index has 225 entries (487 at peak, 638 added, 413 deleted).
% 11.36/11.58 ; Trie-index has 612 nodes (1,053 at peak, 1,336 added, 724 deleted).
% 11.36/11.58 ; Retrieved 2,414 generalization terms in 107,892 calls.
% 11.36/11.58 ; Retrieved 133 instance terms in 63 calls.
% 11.36/11.58 ; Retrieved 6,258,267 unifiable terms in 251,952 calls.
% 11.36/11.58 ;
% 11.36/11.58 ; The agenda of rows to process has 27 entries:
% 11.36/11.58 ; 1 with value 10 1 with value 15 8 with value 19
% 11.36/11.58 ; 1 with value 11 2 with value 16 4 with value 21
% 11.36/11.58 ; 2 with value 12 2 with value 17 1 with value 22
% 11.36/11.58 ; 1 with value 13 2 with value 18 1 with value 23
% 11.36/11.58 ; 1 with value 14
% 11.36/11.58 ; The agenda of rows to give has 127 entries:
% 11.36/11.58 ; 4 with value (4 15) 10 with value (4 19) 5 with value (4 23)
% 11.36/11.58 ; 3 with value (4 16) 36 with value (4 20) 6 with value (4 24)
% 11.36/11.58 ; 13 with value (4 17) 13 with value (4 21) 4 with value (4 25)
% 11.36/11.58 ; 15 with value (4 18) 15 with value (4 22) 3 with value (4 26)
% 11.36/11.58 Evaluation took:
% 11.36/11.58 11.186 seconds of real time
% 11.36/11.58 11.044144 seconds of user run time
% 11.36/11.58 0.141298 seconds of system run time
% 11.36/11.58 [Run times include 0.255 seconds GC run time.]
% 11.36/11.58 0 calls to %EVAL
% 11.36/11.58 0 page faults and
% 11.36/11.58 982,249,800 bytes consed.
% 11.36/11.58 :PROOF-FOUND
% 11.36/11.58 ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-14T10:37:54
% 11.36/11.59 :PROOF-FOUND
% 11.36/11.59 *
%------------------------------------------------------------------------------