TSTP Solution File: GRP285-1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : GRP285-1 : TPTP v8.1.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n028.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:46 EDT 2022
% Result : Unsatisfiable 0.77s 0.95s
% Output : Refutation 0.77s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 11
% Syntax : Number of clauses : 38 ( 14 unt; 19 nHn; 27 RR)
% Number of literals : 81 ( 80 equ; 29 neg)
% Maximal clause size : 11 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 8 con; 0-2 aty)
% Number of variables : 31 ( 2 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_c9,sk_c8) = sk_c7
| multiply(sk_c9,sk_c6) = sk_c7 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_5) ).
cnf(prove_this_6,negated_conjecture,
( multiply(sk_c9,sk_c8) = sk_c7
| multiply(sk_c5,sk_c9) = sk_c6 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_6) ).
cnf(prove_this_7,negated_conjecture,
( multiply(sk_c9,sk_c8) = sk_c7
| inverse(sk_c5) = sk_c9 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_7) ).
cnf(prove_this_10,negated_conjecture,
( multiply(sk_c1,sk_c9) = sk_c8
| multiply(sk_c4,sk_c7) = sk_c8 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_10) ).
cnf(prove_this_11,negated_conjecture,
( multiply(sk_c1,sk_c9) = sk_c8
| inverse(sk_c4) = sk_c7 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_11) ).
cnf(prove_this_17,negated_conjecture,
( inverse(sk_c1) = sk_c9
| multiply(sk_c4,sk_c7) = sk_c8 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_17) ).
cnf(prove_this_18,negated_conjecture,
( inverse(sk_c1) = sk_c9
| inverse(sk_c4) = sk_c7 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_18) ).
cnf(prove_this_29,negated_conjecture,
( multiply(sk_c9,sk_c8) != sk_c7
| multiply(X,sk_c9) != sk_c8
| inverse(X) != sk_c9
| multiply(Y,sk_c9) != sk_c7
| multiply(Z,sk_c9) != sk_c8
| inverse(Z) != sk_c9
| multiply(U,sk_c7) != sk_c8
| inverse(U) != sk_c7
| multiply(sk_c9,V) != sk_c7
| multiply(W,sk_c9) != V
| inverse(W) != sk_c9 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_29) ).
cnf(33,plain,
( multiply(sk_c9,sk_c8) != sk_c7
| multiply(X,sk_c9) != sk_c7
| multiply(Y,sk_c9) != sk_c8
| inverse(Y) != sk_c9
| multiply(Z,sk_c7) != sk_c8
| inverse(Z) != sk_c7 ),
inference('CONDENSE',[status(thm)],[prove_this_29]) ).
cnf(38,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(39,plain,
multiply(multiply(X,inverse(Y)),Y) = multiply(X,identity),
inference('PARAMODULATE',[status(thm)],[associativity,left_inverse,theory(equality)]) ).
cnf(147,plain,
X = multiply(inverse(inverse(X)),identity),
inference('PARAMODULATE',[status(thm)],[38,left_inverse,theory(equality)]) ).
cnf(148,plain,
multiply(X,Y) = multiply(inverse(inverse(X)),Y),
inference('PARAMODULATE',[status(thm)],[38,38,theory(equality)]) ).
cnf(149,plain,
X = multiply(X,identity),
inference('REWRITE',[status(thm)],[147,148,theory(equality)]) ).
cnf(150,plain,
multiply(multiply(X,inverse(Y)),Y) = X,
inference('REWRITE',[status(thm)],[39,149,theory(equality)]) ).
cnf(152,plain,
( inverse(sk_c1) = sk_c9
| sk_c7 = multiply(inverse(sk_c4),sk_c8) ),
inference('PARAMODULATE',[status(thm)],[38,prove_this_17,theory(equality)]) ).
cnf(184,plain,
X = inverse(inverse(X)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[150,left_inverse,theory(equality)]),left_identity,theory(equality)]) ).
cnf(191,plain,
( multiply(sk_c9,sk_c8) != sk_c7
| multiply(X,sk_c9) != sk_c8
| inverse(X) != sk_c9
| multiply(Y,sk_c7) != sk_c8
| inverse(Y) != sk_c7 ),
inference('CONDENSE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[33,150,theory(equality)])]) ).
cnf(192,plain,
multiply(X,inverse(X)) = identity,
inference('PARAMODULATE',[status(thm)],[left_inverse,184,theory(equality)]) ).
cnf(253,plain,
( inverse(sk_c1) = sk_c9
| sk_c7 = multiply(sk_c7,sk_c8) ),
inference('PARAMODULATE',[status(thm)],[152,prove_this_18,theory(equality)]) ).
cnf(258,plain,
( inverse(sk_c1) = sk_c9
| identity = sk_c8 ),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[38,253,theory(equality)]),left_inverse,theory(equality)]) ).
cnf(262,plain,
( identity = sk_c8
| multiply(sk_c1,sk_c9) = identity ),
inference('PARAMODULATE',[status(thm)],[192,258,theory(equality)]) ).
cnf(269,plain,
( identity = sk_c8
| inverse(sk_c4) = sk_c7 ),
inference('PARAMODULATE',[status(thm)],[prove_this_11,262,theory(equality)]) ).
cnf(271,plain,
( identity = sk_c8
| multiply(sk_c4,sk_c7) = sk_c8 ),
inference('PARAMODULATE',[status(thm)],[prove_this_10,262,theory(equality)]) ).
cnf(280,plain,
( identity = sk_c8
| multiply(sk_c4,sk_c7) = identity ),
inference('PARAMODULATE',[status(thm)],[192,269,theory(equality)]) ).
cnf(573,plain,
identity = sk_c8,
inference('PARAMODULATE',[status(thm)],[271,280,theory(equality)]) ).
cnf(578,plain,
( sk_c9 = sk_c7
| multiply(sk_c9,sk_c6) = sk_c7 ),
inference('REWRITE',[status(thm)],[prove_this_5,149,573,theory(equality)]) ).
cnf(579,plain,
( sk_c9 = sk_c7
| multiply(sk_c5,sk_c9) = sk_c6 ),
inference('REWRITE',[status(thm)],[prove_this_6,149,573,theory(equality)]) ).
cnf(580,plain,
( sk_c9 = sk_c7
| inverse(sk_c5) = sk_c9 ),
inference('REWRITE',[status(thm)],[prove_this_7,149,573,theory(equality)]) ).
cnf(658,plain,
( sk_c9 != sk_c7
| multiply(X,sk_c9) != identity
| inverse(X) != sk_c9
| multiply(Y,sk_c7) != identity
| inverse(Y) != sk_c7 ),
inference('REWRITE',[status(thm)],[191,149,573,theory(equality)]) ).
cnf(747,plain,
( sk_c9 = sk_c7
| sk_c9 = multiply(inverse(sk_c5),sk_c6) ),
inference('PARAMODULATE',[status(thm)],[38,579,theory(equality)]) ).
cnf(865,plain,
( sk_c9 = sk_c7
| sk_c9 = multiply(sk_c9,sk_c6) ),
inference('PARAMODULATE',[status(thm)],[747,580,theory(equality)]) ).
cnf(868,plain,
sk_c9 = sk_c7,
inference('PARAMODULATE',[status(thm)],[578,865,theory(equality)]) ).
cnf(1049,plain,
( multiply(X,sk_c7) != identity
| inverse(X) != sk_c7 ),
inference('CONDENSE',[status(thm)],[inference('REWRITE',[status(thm)],[658,868,theory(equality)])]) ).
cnf(1135,plain,
$false,
inference('HYPERRESOLVE',[status(thm)],[1049,left_inverse,184]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : GRP285-1 : TPTP v8.1.0. Released v2.5.0.
% 0.10/0.12 % Command : run-snark %s %d
% 0.11/0.31 % Computer : n028.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 300
% 0.11/0.31 % WCLimit : 600
% 0.11/0.31 % DateTime : Mon Jun 13 06:20:07 EDT 2022
% 0.17/0.31 % CPUTime :
% 0.17/0.44 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.17/0.45 *
% 0.17/0.45 *
% 0.17/0.45 #<PACKAGE "SNARK-USER">
% 0.17/0.45 *
% 0.17/0.45 SNARK-TPTP-OPTIONS
% 0.17/0.45 *
% 0.17/0.45 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.17/0.45 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.17/0.45 (USE-FACTORING :POS)
% 0.17/0.45 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.17/0.45 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.17/0.45 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.17/0.45 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.17/0.45 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.17/0.45 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.17/0.45 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.17/0.45 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.17/0.45 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.17/0.45 (DECLARE-TPTP-SYMBOLS2))
% 0.17/0.45 *
% 0.17/0.45 "."
% 0.17/0.45 *
% 0.17/0.45 ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-13T06:20:07
% 0.17/0.45 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n028.cluster.edu at 2022-06-13T06:20:07
% 0.17/0.47
% 0.17/0.47 ; Recognized left identity assertion (= (|multiply| |identity| ?X) ?X).
% 0.17/0.47 ; Recognized possible left inverse assertion (= (|multiply| (|inverse| ?X) ?X) |identity|).
% 0.77/0.95 ; Recognized associativity assertion (= (|multiply| (|multiply| ?X ?Y) ?Z) (|multiply| ?X (|multiply| ?Y ?Z))).
% 0.77/0.95
% 0.77/0.95 #||
% 0.77/0.95 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.77/0.95 % SZS output start Refutation
% See solution above
% 0.77/0.95 ||#
% 0.77/0.95
% 0.77/0.95 ; Summary of computation:
% 0.77/0.95 ; 3132 formulas have been input or derived (from 182 formulas).
% 0.77/0.95 ; 1135 (36%) were retained. Of these,
% 0.77/0.95 ; 848 (75%) were simplified or subsumed later,
% 0.77/0.95 ; 287 (25%) are still being kept.
% 0.77/0.95 ;
% 0.77/0.95 ; Run time in seconds excluding printing time:
% 0.77/0.95 ; 0.006 1% Read assertion file (1 call)
% 0.77/0.95 ; 0.002 0% Assert (32 calls)
% 0.77/0.95 ; 0.087 18% Process new row (3,071 calls)
% 0.77/0.95 ; 0.021 4% Resolution (362 calls)
% 0.77/0.95 ; 0.034 7% Paramodulation (181 calls)
% 0.77/0.95 ; 0.002 0% Factoring (162 calls)
% 0.77/0.95 ; 0.016 3% Condensing (1,996 calls)
% 0.77/0.95 ; 0.110 22% Forward subsumption (1,996 calls)
% 0.77/0.95 ; 0.037 8% Backward subsumption (1,089 calls)
% 0.77/0.95 ; 0.007 1% Clause clause subsumption (2,363 calls)
% 0.77/0.95 ; 0.076 15% Forward simplification (2,773 calls)
% 0.77/0.95 ; 0.026 5% Backward simplification (1,134 calls)
% 0.77/0.95 ; 0.027 5% Ordering (10,516 calls)
% 0.77/0.95 ; 0.000 0% Sortal reasoning (32 calls)
% 0.77/0.95 ; 0.000 0% Purity testing (1 call)
% 0.77/0.95 ; 0.040 8% Other
% 0.77/0.95 ; 0.491 Total
% 0.77/0.95 ; 0.494 Real time
% 0.77/0.95 ;
% 0.77/0.95 ; Term-hash-array has 641 terms in all.
% 0.77/0.95 ; Feature-vector-row-index has 256 entries (458 at peak, 1,089 added, 833 deleted).
% 0.77/0.95 ; Feature-vector-row-index has 1,365 nodes (3,505 at peak, 7,643 added, 6,278 deleted).
% 0.77/0.95 ; Retrieved 2,476 possibly forward subsuming rows in 1,996 calls.
% 0.77/0.95 ; Retrieved 663 possibly backward subsumed rows in 1,089 calls.
% 0.77/0.95 ; Path-index has 320 entries (463 at peak, 836 added, 516 deleted).
% 0.77/0.95 ; Path-index has 311 nodes (369 at peak, 499 added, 188 deleted).
% 0.77/0.95 ; Trie-index has 320 entries (463 at peak, 836 added, 516 deleted).
% 0.77/0.95 ; Trie-index has 845 nodes (1,150 at peak, 1,950 added, 1,105 deleted).
% 0.77/0.95 ; Retrieved 3,211 generalization terms in 13,544 calls.
% 0.77/0.95 ; Retrieved 117 instance terms in 63 calls.
% 0.77/0.95 ; Retrieved 9,926 unifiable terms in 2,072 calls.
% 0.77/0.95 ;
% 0.77/0.95 ; The agenda of rows to process has 56 entries:
% 0.77/0.95 ; 1 with value 11 14 with value 15 7 with value 19
% 0.77/0.95 ; 1 with value 12 9 with value 16 16 with value 20
% 0.77/0.95 ; 1 with value 13 1 with value 17 3 with value 21
% 0.77/0.95 ; 1 with value 14 1 with value 18 1 with value 22
% 0.77/0.95 ; The agenda of rows to give has 240 entries:
% 0.77/0.95 ; 6 with value (4 15) 49 with value (4 19) 22 with value (4 23)
% 0.77/0.95 ; 21 with value (4 16) 37 with value (4 20) 11 with value (4 24)
% 0.77/0.95 ; 27 with value (4 17) 23 with value (4 21) 4 with value (4 25)
% 0.77/0.95 ; 25 with value (4 18) 14 with value (4 22) 1 with value (4 26)
% 0.77/0.95 Evaluation took:
% 0.77/0.95 0.495 seconds of real time
% 0.77/0.95 0.454663 seconds of user run time
% 0.77/0.95 0.040208 seconds of system run time
% 0.77/0.95 [Run times include 0.017 seconds GC run time.]
% 0.77/0.95 0 calls to %EVAL
% 0.77/0.95 0 page faults and
% 0.77/0.95 35,315,048 bytes consed.
% 0.77/0.95 :PROOF-FOUND
% 0.77/0.95 ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-13T06:20:08
% 0.77/0.95 :PROOF-FOUND
% 0.77/0.95 *
%------------------------------------------------------------------------------