TSTP Solution File: GRP355-1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : GRP355-1 : TPTP v8.1.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n014.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:58 EDT 2022
% Result : Unsatisfiable 2.00s 2.18s
% Output : Refutation 2.00s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 11
% Syntax : Number of clauses : 38 ( 14 unt; 19 nHn; 27 RR)
% Number of literals : 85 ( 84 equ; 33 neg)
% Maximal clause size : 10 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 9 con; 0-2 aty)
% Number of variables : 32 ( 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_5,negated_conjecture,
( multiply(sk_c7,sk_c6) = sk_c8
| multiply(sk_c8,sk_c5) = sk_c6 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_5) ).
cnf(prove_this_6,negated_conjecture,
( multiply(sk_c7,sk_c6) = sk_c8
| multiply(sk_c4,sk_c8) = sk_c5 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_6) ).
cnf(prove_this_7,negated_conjecture,
( multiply(sk_c7,sk_c6) = sk_c8
| inverse(sk_c4) = sk_c8 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_7) ).
cnf(prove_this_10,negated_conjecture,
( multiply(sk_c1,sk_c8) = sk_c7
| multiply(sk_c3,sk_c6) = sk_c7 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_10) ).
cnf(prove_this_11,negated_conjecture,
( multiply(sk_c1,sk_c8) = sk_c7
| inverse(sk_c3) = sk_c6 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_11) ).
cnf(prove_this_15,negated_conjecture,
( inverse(sk_c1) = sk_c8
| multiply(sk_c2,sk_c8) = sk_c7 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_15) ).
cnf(prove_this_16,negated_conjecture,
( inverse(sk_c1) = sk_c8
| inverse(sk_c2) = sk_c8 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_16) ).
cnf(prove_this_22,negated_conjecture,
( multiply(sk_c7,sk_c6) != sk_c8
| multiply(X,sk_c8) != sk_c7
| inverse(X) != sk_c8
| multiply(Y,sk_c8) != sk_c7
| inverse(Y) != sk_c8
| multiply(Z,sk_c6) != sk_c7
| inverse(Z) != sk_c6
| multiply(sk_c8,U) != sk_c6
| multiply(V,sk_c8) != U
| inverse(V) != sk_c8 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_22) ).
cnf(26,plain,
( multiply(sk_c7,sk_c6) != sk_c8
| multiply(X,sk_c8) != sk_c7
| inverse(X) != sk_c8
| multiply(Y,sk_c6) != sk_c7
| inverse(Y) != sk_c6
| multiply(sk_c8,Z) != sk_c6
| multiply(U,sk_c8) != Z
| inverse(U) != sk_c8 ),
inference('CONDENSE',[status(thm)],[prove_this_22]) ).
cnf(31,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(32,plain,
multiply(multiply(X,inverse(Y)),Y) = multiply(X,identity),
inference('PARAMODULATE',[status(thm)],[associativity,left_inverse,theory(equality)]) ).
cnf(121,plain,
X = multiply(inverse(inverse(X)),identity),
inference('PARAMODULATE',[status(thm)],[31,left_inverse,theory(equality)]) ).
cnf(122,plain,
multiply(X,Y) = multiply(inverse(inverse(X)),Y),
inference('PARAMODULATE',[status(thm)],[31,31,theory(equality)]) ).
cnf(123,plain,
X = multiply(X,identity),
inference('REWRITE',[status(thm)],[121,122,theory(equality)]) ).
cnf(124,plain,
multiply(multiply(X,inverse(Y)),Y) = X,
inference('REWRITE',[status(thm)],[32,123,theory(equality)]) ).
cnf(126,plain,
( inverse(sk_c1) = sk_c8
| sk_c8 = multiply(inverse(sk_c2),sk_c7) ),
inference('PARAMODULATE',[status(thm)],[31,prove_this_15,theory(equality)]) ).
cnf(144,plain,
( multiply(sk_c7,sk_c6) = sk_c8
| sk_c8 = multiply(inverse(sk_c4),sk_c5) ),
inference('PARAMODULATE',[status(thm)],[31,prove_this_6,theory(equality)]) ).
cnf(152,plain,
( multiply(sk_c7,sk_c6) != sk_c8
| multiply(X,sk_c8) != sk_c7
| inverse(X) != sk_c8
| multiply(Y,sk_c6) != sk_c7
| inverse(Y) != sk_c6
| sk_c6 != sk_c8
| multiply(Z,sk_c8) != identity
| inverse(Z) != sk_c8 ),
inference('PARAMODULATE',[status(thm)],[26,123,theory(equality)]) ).
cnf(153,plain,
X = inverse(inverse(X)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[124,left_inverse,theory(equality)]),left_identity,theory(equality)]) ).
cnf(164,plain,
multiply(X,inverse(X)) = identity,
inference('PARAMODULATE',[status(thm)],[left_inverse,153,theory(equality)]) ).
cnf(242,plain,
( inverse(sk_c1) = sk_c8
| sk_c8 = multiply(sk_c8,sk_c7) ),
inference('PARAMODULATE',[status(thm)],[126,prove_this_16,theory(equality)]) ).
cnf(247,plain,
( inverse(sk_c1) = sk_c8
| identity = sk_c7 ),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[31,242,theory(equality)]),left_inverse,theory(equality)]) ).
cnf(252,plain,
( identity = sk_c7
| multiply(sk_c1,sk_c8) = identity ),
inference('PARAMODULATE',[status(thm)],[164,247,theory(equality)]) ).
cnf(265,plain,
( identity = sk_c7
| inverse(sk_c3) = sk_c6 ),
inference('PARAMODULATE',[status(thm)],[prove_this_11,252,theory(equality)]) ).
cnf(267,plain,
( identity = sk_c7
| multiply(sk_c3,sk_c6) = sk_c7 ),
inference('PARAMODULATE',[status(thm)],[prove_this_10,252,theory(equality)]) ).
cnf(280,plain,
( identity = sk_c7
| multiply(sk_c3,sk_c6) = identity ),
inference('PARAMODULATE',[status(thm)],[164,265,theory(equality)]) ).
cnf(578,plain,
identity = sk_c7,
inference('PARAMODULATE',[status(thm)],[267,280,theory(equality)]) ).
cnf(583,plain,
( sk_c6 = sk_c8
| multiply(sk_c8,sk_c5) = sk_c6 ),
inference('REWRITE',[status(thm)],[prove_this_5,left_identity,578,theory(equality)]) ).
cnf(585,plain,
( sk_c6 = sk_c8
| inverse(sk_c4) = sk_c8 ),
inference('REWRITE',[status(thm)],[prove_this_7,left_identity,578,theory(equality)]) ).
cnf(662,plain,
( sk_c6 = sk_c8
| sk_c8 = multiply(inverse(sk_c4),sk_c5) ),
inference('REWRITE',[status(thm)],[144,left_identity,578,theory(equality)]) ).
cnf(666,plain,
( sk_c6 != sk_c8
| multiply(X,sk_c6) != identity
| inverse(X) != sk_c6
| multiply(Y,sk_c8) != identity
| inverse(Y) != sk_c8 ),
inference('CONDENSE',[status(thm)],[inference('REWRITE',[status(thm)],[152,left_identity,578,theory(equality)])]) ).
cnf(810,plain,
( sk_c6 = sk_c8
| sk_c8 = multiply(sk_c8,sk_c5) ),
inference('PARAMODULATE',[status(thm)],[662,585,theory(equality)]) ).
cnf(811,plain,
sk_c6 = sk_c8,
inference('PARAMODULATE',[status(thm)],[583,810,theory(equality)]) ).
cnf(950,plain,
( multiply(X,sk_c6) != identity
| inverse(X) != sk_c6 ),
inference('CONDENSE',[status(thm)],[inference('REWRITE',[status(thm)],[666,811,theory(equality)])]) ).
cnf(1003,plain,
$false,
inference('HYPERRESOLVE',[status(thm)],[950,left_inverse,153]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP355-1 : TPTP v8.1.0. Released v2.5.0.
% 0.07/0.13 % Command : run-snark %s %d
% 0.13/0.33 % Computer : n014.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Mon Jun 13 05:55:22 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.45 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.46 *
% 0.19/0.46 *
% 0.19/0.46 #<PACKAGE "SNARK-USER">
% 0.19/0.46 *
% 0.19/0.46 SNARK-TPTP-OPTIONS
% 0.19/0.46 *
% 0.19/0.46 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.19/0.46 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.19/0.46 (USE-FACTORING :POS)
% 0.19/0.46 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.19/0.46 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.19/0.46 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.19/0.46 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.19/0.46 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.19/0.46 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.19/0.46 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.19/0.46 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.19/0.46 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.19/0.46 (DECLARE-TPTP-SYMBOLS2))
% 0.19/0.46 *
% 0.19/0.46 "."
% 0.19/0.46 *
% 0.19/0.47 ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-13T05:55:22
% 0.19/0.47 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n014.cluster.edu at 2022-06-13T05:55:22
% 0.19/0.48
% 0.19/0.48 ; Recognized left identity assertion (= (|multiply| |identity| ?X) ?X).
% 0.19/0.48 ; Recognized possible left inverse assertion (= (|multiply| (|inverse| ?X) ?X) |identity|).
% 2.00/2.18 ; Recognized associativity assertion (= (|multiply| (|multiply| ?X ?Y) ?Z) (|multiply| ?X (|multiply| ?Y ?Z))).
% 2.00/2.18
% 2.00/2.18 #||
% 2.00/2.18 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.00/2.18 % SZS output start Refutation
% See solution above
% 2.00/2.19 ||#
% 2.00/2.19
% 2.00/2.19 ; Summary of computation:
% 2.00/2.19 ; 9275 formulas have been input or derived (from 169 formulas).
% 2.00/2.19 ; 1003 (11%) were retained. Of these,
% 2.00/2.19 ; 792 (79%) were simplified or subsumed later,
% 2.00/2.19 ; 211 (21%) are still being kept.
% 2.00/2.19 ;
% 2.00/2.19 ; Run time in seconds excluding printing time:
% 2.00/2.19 ; 0.005 0% Read assertion file (1 call)
% 2.00/2.19 ; 0.002 0% Assert (25 calls)
% 2.00/2.19 ; 0.088 5% Process new row (5,001 calls)
% 2.00/2.19 ; 0.827 48% Resolution (336 calls)
% 2.00/2.19 ; 0.034 2% Paramodulation (168 calls)
% 2.00/2.19 ; 0.000 0% Factoring (149 calls)
% 2.00/2.19 ; 0.021 1% Condensing (3,990 calls)
% 2.00/2.19 ; 0.424 25% Forward subsumption (3,990 calls)
% 2.00/2.19 ; 0.031 2% Backward subsumption (957 calls)
% 2.00/2.19 ; 0.025 1% Clause clause subsumption (5,660 calls)
% 2.00/2.19 ; 0.165 10% Forward simplification (4,733 calls)
% 2.00/2.19 ; 0.022 1% Backward simplification (1,002 calls)
% 2.00/2.19 ; 0.029 2% Ordering (10,164 calls)
% 2.00/2.19 ; 0.000 0% Sortal reasoning (32 calls)
% 2.00/2.19 ; 0.000 0% Purity testing (1 call)
% 2.00/2.19 ; 0.046 3% Other
% 2.00/2.19 ; 1.719 Total
% 2.00/2.19 ; 1.729 Real time
% 2.00/2.19 ;
% 2.00/2.19 ; Term-hash-array has 712 terms in all.
% 2.00/2.19 ; Feature-vector-row-index has 180 entries (493 at peak, 957 added, 777 deleted).
% 2.00/2.19 ; Feature-vector-row-index has 909 nodes (3,844 at peak, 6,886 added, 5,977 deleted).
% 2.00/2.19 ; Retrieved 29,287 possibly forward subsuming rows in 3,990 calls.
% 2.00/2.19 ; Retrieved 693 possibly backward subsumed rows in 957 calls.
% 2.00/2.19 ; Path-index has 310 entries (541 at peak, 931 added, 621 deleted).
% 2.00/2.19 ; Path-index has 301 nodes (359 at peak, 486 added, 185 deleted).
% 2.00/2.19 ; Trie-index has 310 entries (541 at peak, 931 added, 621 deleted).
% 2.00/2.19 ; Trie-index has 823 nodes (1,199 at peak, 2,010 added, 1,187 deleted).
% 2.00/2.19 ; Retrieved 3,155 generalization terms in 33,799 calls.
% 2.00/2.19 ; Retrieved 129 instance terms in 63 calls.
% 2.00/2.19 ; Retrieved 769,826 unifiable terms in 27,967 calls.
% 2.00/2.19 ;
% 2.00/2.19 ; The agenda of rows to process has 49 entries:
% 2.00/2.19 ; 1 with value 10 14 with value 15 10 with value 20
% 2.00/2.19 ; 1 with value 12 1 with value 16 12 with value 21
% 2.00/2.19 ; 1 with value 13 2 with value 17 1 with value 22
% 2.00/2.19 ; 4 with value 14 1 with value 19 1 with value 23
% 2.00/2.19 ; The agenda of rows to give has 166 entries:
% 2.00/2.19 ; 7 with value (4 16) 31 with value (4 20) 12 with value (4 24)
% 2.00/2.19 ; 18 with value (4 17) 18 with value (4 21) 4 with value (4 25)
% 2.00/2.19 ; 19 with value (4 18) 12 with value (4 22) 1 with value (4 26)
% 2.00/2.19 ; 30 with value (4 19) 14 with value (4 23)
% 2.00/2.19 Evaluation took:
% 2.00/2.19 1.729 seconds of real time
% 2.00/2.19 1.673576 seconds of user run time
% 2.00/2.19 0.055866 seconds of system run time
% 2.00/2.19 [Run times include 0.054 seconds GC run time.]
% 2.00/2.19 0 calls to %EVAL
% 2.00/2.19 0 page faults and
% 2.00/2.19 153,882,840 bytes consed.
% 2.00/2.19 :PROOF-FOUND
% 2.00/2.19 ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-13T05:55:24
% 2.00/2.19 :PROOF-FOUND
% 2.00/2.19 *
%------------------------------------------------------------------------------