TSTP Solution File: GRP300-1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : GRP300-1 : TPTP v8.1.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n022.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:49 EDT 2022
% Result : Unsatisfiable 3.45s 3.62s
% Output : Refutation 3.45s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 12
% Syntax : Number of clauses : 45 ( 24 unt; 18 nHn; 31 RR)
% Number of literals : 80 ( 79 equ; 22 neg)
% Maximal clause size : 10 ( 1 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 : 28 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(left_identity,axiom,
multiply(identity,X) = X,
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-0.ax',left_identity) ).
cnf(left_inverse,axiom,
multiply(inverse(X),X) = identity,
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-0.ax',left_inverse) ).
cnf(associativity,axiom,
multiply(multiply(X,Y),Z) = multiply(X,multiply(Y,Z)),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-0.ax',associativity) ).
cnf(prove_this_1,negated_conjecture,
( multiply(sk_c6,sk_c5) = sk_c4
| multiply(sk_c5,sk_c4) = sk_c6 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_1) ).
cnf(prove_this_11,negated_conjecture,
( multiply(sk_c1,sk_c6) = sk_c5
| multiply(sk_c3,sk_c4) = sk_c5 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_11) ).
cnf(prove_this_12,negated_conjecture,
( multiply(sk_c1,sk_c6) = sk_c5
| inverse(sk_c3) = sk_c4 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_12) ).
cnf(prove_this_17,negated_conjecture,
( inverse(sk_c1) = sk_c6
| multiply(sk_c3,sk_c4) = sk_c5 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_17) ).
cnf(prove_this_18,negated_conjecture,
( inverse(sk_c1) = sk_c6
| inverse(sk_c3) = sk_c4 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_18) ).
cnf(prove_this_20,negated_conjecture,
( multiply(sk_c4,sk_c6) = sk_c5
| multiply(sk_c2,sk_c6) = sk_c5 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_20) ).
cnf(prove_this_21,negated_conjecture,
( multiply(sk_c4,sk_c6) = sk_c5
| inverse(sk_c2) = sk_c6 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_21) ).
cnf(prove_this_22,negated_conjecture,
( multiply(sk_c4,sk_c6) = sk_c5
| inverse(sk_c6) = sk_c4 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_22) ).
cnf(prove_this_25,negated_conjecture,
( multiply(sk_c6,sk_c5) != sk_c4
| multiply(X,sk_c6) != sk_c5
| inverse(X) != sk_c6
| multiply(sk_c4,sk_c6) != sk_c5
| multiply(sk_c5,sk_c4) != sk_c6
| multiply(Y,sk_c6) != sk_c5
| inverse(Y) != sk_c6
| inverse(sk_c6) != sk_c4
| multiply(Z,sk_c4) != sk_c5
| inverse(Z) != sk_c4 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_25) ).
cnf(29,plain,
( multiply(sk_c6,sk_c5) != sk_c4
| multiply(sk_c4,sk_c6) != sk_c5
| multiply(sk_c5,sk_c4) != sk_c6
| multiply(X,sk_c6) != sk_c5
| inverse(X) != sk_c6
| inverse(sk_c6) != sk_c4
| multiply(Y,sk_c4) != sk_c5
| inverse(Y) != sk_c4 ),
inference('CONDENSE',[status(thm)],[prove_this_25]) ).
cnf(34,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(35,plain,
multiply(multiply(X,inverse(Y)),Y) = multiply(X,identity),
inference('PARAMODULATE',[status(thm)],[associativity,left_inverse,theory(equality)]) ).
cnf(117,plain,
X = multiply(inverse(inverse(X)),identity),
inference('PARAMODULATE',[status(thm)],[34,left_inverse,theory(equality)]) ).
cnf(118,plain,
multiply(X,Y) = multiply(inverse(inverse(X)),Y),
inference('PARAMODULATE',[status(thm)],[34,34,theory(equality)]) ).
cnf(119,plain,
X = multiply(X,identity),
inference('REWRITE',[status(thm)],[117,118,theory(equality)]) ).
cnf(120,plain,
multiply(multiply(X,inverse(Y)),Y) = X,
inference('REWRITE',[status(thm)],[35,119,theory(equality)]) ).
cnf(122,plain,
( inverse(sk_c1) = sk_c6
| sk_c4 = multiply(inverse(sk_c3),sk_c5) ),
inference('PARAMODULATE',[status(thm)],[34,prove_this_17,theory(equality)]) ).
cnf(131,plain,
( inverse(sk_c6) = sk_c4
| sk_c6 = multiply(inverse(sk_c4),sk_c5) ),
inference('PARAMODULATE',[status(thm)],[34,prove_this_22,theory(equality)]) ).
cnf(147,plain,
inverse(identity) = identity,
inference('PARAMODULATE',[status(thm)],[left_inverse,119,theory(equality)]) ).
cnf(150,plain,
X = inverse(inverse(X)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[120,left_inverse,theory(equality)]),left_identity,theory(equality)]) ).
cnf(159,plain,
multiply(X,inverse(X)) = identity,
inference('PARAMODULATE',[status(thm)],[left_inverse,150,theory(equality)]) ).
cnf(160,plain,
multiply(multiply(X,Y),inverse(Y)) = X,
inference('PARAMODULATE',[status(thm)],[120,150,theory(equality)]) ).
cnf(172,plain,
inverse(X) = multiply(inverse(multiply(Y,X)),Y),
inference('PARAMODULATE',[status(thm)],[34,160,theory(equality)]) ).
cnf(247,plain,
( inverse(sk_c1) = sk_c6
| sk_c4 = multiply(sk_c4,sk_c5) ),
inference('PARAMODULATE',[status(thm)],[122,prove_this_18,theory(equality)]) ).
cnf(252,plain,
( inverse(sk_c1) = sk_c6
| identity = sk_c5 ),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[34,247,theory(equality)]),left_inverse,theory(equality)]) ).
cnf(256,plain,
( identity = sk_c5
| multiply(sk_c1,sk_c6) = identity ),
inference('PARAMODULATE',[status(thm)],[159,252,theory(equality)]) ).
cnf(267,plain,
( identity = sk_c5
| inverse(sk_c3) = sk_c4 ),
inference('PARAMODULATE',[status(thm)],[prove_this_12,256,theory(equality)]) ).
cnf(270,plain,
( identity = sk_c5
| multiply(sk_c3,sk_c4) = sk_c5 ),
inference('PARAMODULATE',[status(thm)],[prove_this_11,256,theory(equality)]) ).
cnf(273,plain,
( identity = sk_c5
| multiply(sk_c3,sk_c4) = identity ),
inference('PARAMODULATE',[status(thm)],[159,267,theory(equality)]) ).
cnf(395,plain,
multiply(inverse(X),Y) = inverse(multiply(inverse(Y),X)),
inference('PARAMODULATE',[status(thm)],[120,172,theory(equality)]) ).
cnf(767,plain,
identity = sk_c5,
inference('PARAMODULATE',[status(thm)],[270,273,theory(equality)]) ).
cnf(768,plain,
sk_c4 = sk_c6,
inference('REWRITE',[status(thm)],[prove_this_1,left_identity,119,767,theory(equality)]) ).
cnf(852,plain,
( multiply(sk_c4,sk_c4) = identity
| multiply(sk_c2,sk_c4) = identity ),
inference('REWRITE',[status(thm)],[prove_this_20,768,767,theory(equality)]) ).
cnf(853,plain,
( multiply(sk_c4,sk_c4) = identity
| inverse(sk_c2) = sk_c4 ),
inference('REWRITE',[status(thm)],[prove_this_21,768,767,theory(equality)]) ).
cnf(857,plain,
( multiply(sk_c4,sk_c4) != identity
| inverse(sk_c4) != sk_c4 ),
inference('CONDENSE',[status(thm)],[inference('REWRITE',[status(thm)],[29,left_identity,119,768,767,theory(equality)])]) ).
cnf(884,plain,
inverse(sk_c4) = sk_c4,
inference('REWRITE',[status(thm)],[131,left_identity,147,395,768,767,theory(equality)]) ).
cnf(893,plain,
multiply(sk_c4,sk_c4) != identity,
inference('REWRITE',[status(thm)],[857,884,theory(equality)]) ).
cnf(895,plain,
multiply(sk_c2,sk_c4) = identity,
inference('REWRITE',[status(thm)],[852,893]) ).
cnf(896,plain,
inverse(sk_c2) = sk_c4,
inference('REWRITE',[status(thm)],[853,893]) ).
cnf(900,plain,
sk_c2 = sk_c4,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[150,896,theory(equality)]),884,theory(equality)]) ).
cnf(915,plain,
multiply(sk_c2,sk_c2) != identity,
inference('REWRITE',[status(thm)],[893,900,theory(equality)]) ).
cnf(917,plain,
$false,
inference('REWRITE',[status(thm)],[895,915,900,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : GRP300-1 : TPTP v8.1.0. Released v2.5.0.
% 0.07/0.14 % Command : run-snark %s %d
% 0.14/0.36 % Computer : n022.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Mon Jun 13 17:59:18 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.21/0.49 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.50 *
% 0.21/0.50 *
% 0.21/0.50 #<PACKAGE "SNARK-USER">
% 0.21/0.50 *
% 0.21/0.50 SNARK-TPTP-OPTIONS
% 0.21/0.50 *
% 0.21/0.50 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.21/0.50 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.21/0.50 (USE-FACTORING :POS)
% 0.21/0.50 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.21/0.50 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.21/0.50 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.21/0.50 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.21/0.50 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.21/0.50 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.21/0.50 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.21/0.50 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.21/0.50 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.21/0.50 (DECLARE-TPTP-SYMBOLS2))
% 0.21/0.50 *
% 0.21/0.50 "."
% 0.21/0.50 *
% 0.21/0.50 ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-13T17:59:18
% 0.21/0.50 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n022.cluster.edu at 2022-06-13T17:59:18
% 0.35/0.52
% 0.35/0.52 ; Recognized left identity assertion (= (|multiply| |identity| ?X) ?X).
% 0.35/0.52 ; Recognized possible left inverse assertion (= (|multiply| (|inverse| ?X) ?X) |identity|).
% 3.45/3.62 ; Recognized associativity assertion (= (|multiply| (|multiply| ?X ?Y) ?Z) (|multiply| ?X (|multiply| ?Y ?Z))).
% 3.45/3.62
% 3.45/3.62 #||
% 3.45/3.62 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.45/3.62 % SZS output start Refutation
% See solution above
% 3.45/3.63 ||#
% 3.45/3.63
% 3.45/3.63 ; Summary of computation:
% 3.45/3.63 ; 26292 formulas have been input or derived (from 122 formulas).
% 3.45/3.63 ; 917 ( 3%) were retained. Of these,
% 3.45/3.63 ; 870 (95%) were simplified or subsumed later,
% 3.45/3.63 ; 47 ( 5%) are still being kept.
% 3.45/3.63 ;
% 3.45/3.63 ; Run time in seconds excluding printing time:
% 3.45/3.63 ; 0.006 0% Read assertion file (1 call)
% 3.45/3.63 ; 0.001 0% Assert (28 calls)
% 3.45/3.63 ; 0.118 4% Process new row (8,383 calls)
% 3.45/3.63 ; 1.465 47% Resolution (242 calls)
% 3.45/3.63 ; 0.033 1% Paramodulation (121 calls)
% 3.45/3.63 ; 0.000 0% Factoring (103 calls)
% 3.45/3.63 ; 0.026 1% Condensing (7,175 calls)
% 3.45/3.63 ; 1.047 34% Forward subsumption (7,175 calls)
% 3.45/3.63 ; 0.024 1% Backward subsumption (858 calls)
% 3.45/3.63 ; 0.067 2% Clause clause subsumption (20,496 calls)
% 3.45/3.63 ; 0.237 8% Forward simplification (8,129 calls)
% 3.45/3.63 ; 0.025 1% Backward simplification (916 calls)
% 3.45/3.63 ; 0.013 0% Ordering (8,701 calls)
% 3.45/3.63 ; 0.000 0% Sortal reasoning (32 calls)
% 3.45/3.63 ; 0.001 0% Purity testing (1 call)
% 3.45/3.63 ; 0.057 2% Other
% 3.45/3.63 ; 3.120 Total
% 3.45/3.63 ; 3.124 Real time
% 3.45/3.63 ;
% 3.45/3.63 ; Term-hash-array has 649 terms in all.
% 3.45/3.63 ; Feature-vector-row-index has 12 entries (642 at peak, 858 added, 846 deleted).
% 3.45/3.63 ; Feature-vector-row-index has 51 nodes (4,391 at peak, 5,608 added, 5,557 deleted).
% 3.45/3.63 ; Retrieved 88,314 possibly forward subsuming rows in 7,175 calls.
% 3.45/3.63 ; Retrieved 432 possibly backward subsumed rows in 858 calls.
% 3.45/3.63 ; Path-index has 133 entries (520 at peak, 761 added, 628 deleted).
% 3.45/3.63 ; Path-index has 200 nodes (317 at peak, 415 added, 215 deleted).
% 3.45/3.63 ; Trie-index has 133 entries (520 at peak, 761 added, 628 deleted).
% 3.45/3.63 ; Trie-index has 386 nodes (1,213 at peak, 1,765 added, 1,379 deleted).
% 3.45/3.63 ; Retrieved 3,173 generalization terms in 59,597 calls.
% 3.45/3.63 ; Retrieved 134 instance terms in 76 calls.
% 3.45/3.63 ; Retrieved 1,232,268 unifiable terms in 48,114 calls.
% 3.45/3.63 ;
% 3.45/3.63 ; The agenda of backward simplifiable rows to process has 4 entries:
% 3.45/3.63 ; 4 with value 0
% 3.45/3.63 ; The agenda of rows to process has 6 entries:
% 3.45/3.63 ; 1 with value 11 2 with value 14 1 with value 17
% 3.45/3.63 ; 2 with value 12
% 3.45/3.63 ; The agenda of input rows to give has 2 entries:
% 3.45/3.63 ; 1 with value 4 1 with value 7
% 3.45/3.63 ; The agenda of rows to give has 32 entries:
% 3.45/3.63 ; 2 with value (4 7) 3 with value (4 18) 1 with value (4 22)
% 3.45/3.63 ; 1 with value (4 8) 7 with value (4 19) 2 with value (4 23)
% 3.45/3.63 ; 1 with value (4 12) 6 with value (4 20) 3 with value (4 24)
% 3.45/3.63 ; 1 with value (4 13) 2 with value (4 21) 1 with value (4 26)
% 3.45/3.63 ; 2 with value (4 16)
% 3.45/3.63 Evaluation took:
% 3.45/3.63 3.125 seconds of real time
% 3.45/3.63 3.013639 seconds of user run time
% 3.45/3.63 0.109722 seconds of system run time
% 3.45/3.63 [Run times include 0.089 seconds GC run time.]
% 3.45/3.63 0 calls to %EVAL
% 3.45/3.63 0 page faults and
% 3.45/3.63 301,807,448 bytes consed.
% 3.45/3.63 :PROOF-FOUND
% 3.45/3.63 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-13T17:59:21
% 3.45/3.63 :PROOF-FOUND
% 3.45/3.63 *
%------------------------------------------------------------------------------