TSTP Solution File: GRP715+1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : GRP715+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n009.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:40:30 EDT 2022
% Result : Theorem 0.92s 1.16s
% Output : Refutation 0.92s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of clauses : 17 ( 16 unt; 0 nHn; 6 RR)
% Number of literals : 18 ( 17 equ; 3 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 14 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(6,axiom,
mult(mult(mult(X,Y),Z),Y) = mult(X,mult(mult(Y,Z),Y)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f06) ).
cnf(7,axiom,
mult(X,mult(Y,Y)) = mult(mult(X,Y),Y),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f07) ).
cnf(8,axiom,
mult(X,unit) = X,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f08) ).
cnf(9,axiom,
mult(unit,X) = X,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f09) ).
cnf(10,axiom,
mult(op_a,op_b) = unit,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f10) ).
cnf(11,axiom,
mult(op_b,op_a) = unit,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f11) ).
cnf(12,negated_conjecture,
( mult(mult('SKOLEMAAAV1',op_a),op_b) != 'SKOLEMAAAV1'
| mult(mult('SKOLEMAAAV1',op_b),op_a) != 'SKOLEMAAAV1' ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
cnf(17,plain,
mult(op_b,mult(op_a,op_a)) = op_a,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[7,11,theory(equality)]),9,theory(equality)]) ).
cnf(35,plain,
mult(mult(mult(X,op_b),op_a),op_b) = mult(X,op_b),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[6,11,theory(equality)]),9,theory(equality)]) ).
cnf(57,plain,
mult(mult(mult(X,op_b),mult(op_a,op_a)),op_b) = X,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[6,17,theory(equality)]),8,10,theory(equality)]) ).
cnf(358,plain,
mult(mult(X,op_a),op_b) = X,
inference('PARAMODULATE',[status(thm)],[35,57,theory(equality)]) ).
cnf(362,plain,
mult(mult('SKOLEMAAAV1',op_b),op_a) != 'SKOLEMAAAV1',
inference('REWRITE',[status(thm)],[12,358,theory(equality)]) ).
cnf(363,plain,
mult(mult(X,mult(op_a,op_a)),op_b) = mult(mult(X,op_b),mult(op_a,op_a)),
inference('PARAMODULATE',[status(thm)],[57,57,theory(equality)]) ).
cnf(365,plain,
mult(mult(mult(X,op_b),op_b),mult(op_a,op_a)) = X,
inference('REWRITE',[status(thm)],[57,363,theory(equality)]) ).
cnf(367,plain,
mult(mult(X,op_b),mult(op_a,op_a)) = mult(X,op_a),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[358,7,theory(equality)]),363,theory(equality)]) ).
cnf(368,plain,
mult(mult(X,op_b),op_a) = X,
inference('REWRITE',[status(thm)],[365,367,theory(equality)]) ).
cnf(369,plain,
$false,
inference('REWRITE',[status(thm)],[362,368,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : GRP715+1 : TPTP v8.1.0. Released v4.0.0.
% 0.10/0.13 % Command : run-snark %s %d
% 0.12/0.33 % Computer : n009.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.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Mon Jun 13 10:59:53 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.45 /export/starexec/sandbox/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.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.47 ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-13T10:59:53
% 0.19/0.47 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n009.cluster.edu at 2022-06-13T10:59:53
% 0.19/0.48
% 0.19/0.48 ; Recognized associativity assertion (= (|plus| (|plus| ?X ?Y) ?Z) (|plus| ?X (|plus| ?Y ?Z))).
% 0.19/0.48 ; Recognized commutativity assertion (= (|plus| ?X ?Y) (|plus| ?Y ?X)).
% 0.19/0.48 ; Recognized right identity assertion (= (|plus| ?X |op_0|) ?X).
% 0.19/0.48 ; Recognized possible right inverse assertion (= (|plus| ?X (|minus| ?X)) |op_0|).
% 0.19/0.48 ; Recognized right identity assertion (= (|mult| ?X |unit|) ?X).
% 0.19/0.48 ; Recognized left identity assertion (= (|mult| |unit| ?X) ?X).
% 0.19/0.48 ; Declaring plus to be commutative.
% 0.92/1.16 ; Declaring plus to be associative-commutative.
% 0.92/1.16
% 0.92/1.16 #||
% 0.92/1.16 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.92/1.16 % SZS output start Refutation
% See solution above
% 0.92/1.16 ||#
% 0.92/1.16
% 0.92/1.16 ; Summary of computation:
% 0.92/1.16 ; 1415 formulas have been input or derived (from 48 formulas).
% 0.92/1.16 ; 369 (26%) were retained. Of these,
% 0.92/1.16 ; 71 (19%) were simplified or subsumed later,
% 0.92/1.16 ; 298 (81%) are still being kept.
% 0.92/1.16 ;
% 0.92/1.16 ; Run time in seconds excluding printing time:
% 0.92/1.16 ; 0.003 0% Read assertion file (1 call)
% 0.92/1.16 ; 0.001 0% Assert (12 calls)
% 0.92/1.16 ; 0.043 6% Process new row (1,396 calls)
% 0.92/1.16 ; 0.000 0% Resolution (94 calls)
% 0.92/1.16 ; 0.033 5% Paramodulation (47 calls)
% 0.92/1.16 ; 0.002 0% Embedding (133 calls)
% 0.92/1.16 ; 0.000 0% Condensing (1 call)
% 0.92/1.16 ; 0.000 0% Forward subsumption (1 call)
% 0.92/1.16 ; 0.000 0% Backward subsumption (1 call)
% 0.92/1.16 ; 0.247 36% Forward simplification (1,256 calls)
% 0.92/1.16 ; 0.028 4% Backward simplification (245 calls)
% 0.92/1.16 ; 0.026 4% Ordering (6,536 calls)
% 0.92/1.16 ; 0.283 41% Ordering ac (5,566 calls)
% 0.92/1.16 ; 0.001 0% Sortal reasoning (32 calls)
% 0.92/1.16 ; 0.000 0% Purity testing (1 call)
% 0.92/1.16 ; 0.028 4% Other
% 0.92/1.16 ; 0.695 Total
% 0.92/1.16 ; 0.697 Real time
% 0.92/1.16 ;
% 0.92/1.16 ; Term-hash-array has 1,424 terms in all.
% 0.92/1.16 ; Feature-vector-row-index has 0 entries (1 at peak, 1 added, 1 deleted).
% 0.92/1.16 ; Feature-vector-row-index has 1 node (15 at peak, 15 added, 14 deleted).
% 0.92/1.16 ; Retrieved 0 possibly forward subsuming rows in 1 call.
% 0.92/1.16 ; Retrieved 0 possibly backward subsumed rows in 1 call.
% 0.92/1.16 ; Path-index has 1,221 entries (1,288 at peak, 1,458 added, 237 deleted).
% 0.92/1.16 ; Path-index has 1,046 nodes (1,078 at peak, 1,134 added, 88 deleted).
% 0.92/1.16 ; Trie-index has 1,221 entries (1,288 at peak, 1,458 added, 237 deleted).
% 0.92/1.16 ; Trie-index has 1,283 nodes (1,521 at peak, 1,679 added, 396 deleted).
% 0.92/1.16 ; Retrieved 425,128 generalization terms in 13,853 calls.
% 0.92/1.16 ; Retrieved 1,958 instance terms in 431 calls.
% 0.92/1.16 ; Retrieved 4,749 unifiable terms in 289 calls.
% 0.92/1.16 ;
% 0.92/1.16 ; The agenda of backward simplifiable rows to process has 6 entries:
% 0.92/1.16 ; 6 with value 0
% 0.92/1.16 ; The agenda of rows to process has 6 entries:
% 0.92/1.16 ; 1 with value 20 1 with value 24 1 with value 28
% 0.92/1.16 ; 3 with value 23
% 0.92/1.16 ; The agenda of rows to give has 262 entries:
% 0.92/1.16 ; 1 with value (4 12) 24 with value (4 25) 5 with value (4 33)
% 0.92/1.16 ; 5 with value (4 17) 30 with value (4 26) 4 with value (4 34)
% 0.92/1.16 ; 5 with value (4 18) 23 with value (4 27) 4 with value (4 35)
% 0.92/1.16 ; 7 with value (4 19) 4 with value (4 28) 5 with value (4 36)
% 0.92/1.16 ; 15 with value (4 20) 15 with value (4 29) 4 with value (4 37)
% 0.92/1.16 ; 15 with value (4 21) 16 with value (4 30) 2 with value (4 38)
% 0.92/1.16 ; 25 with value (4 22) 22 with value (4 31) 2 with value (4 39)
% 0.92/1.16 ; 10 with value (4 23) 2 with value (4 32) 2 with value (4 45)
% 0.92/1.16 ; 15 with value (4 24)
% 0.92/1.16 Evaluation took:
% 0.92/1.16 0.697 seconds of real time
% 0.92/1.16 0.667744 seconds of user run time
% 0.92/1.16 0.029191 seconds of system run time
% 0.92/1.16 [Run times include 0.016 seconds GC run time.]
% 0.92/1.16 0 calls to %EVAL
% 0.92/1.16 0 page faults and
% 0.92/1.16 39,906,480 bytes consed.
% 0.92/1.16 :PROOF-FOUND
% 0.92/1.16 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-13T10:59:53
% 0.92/1.16 :PROOF-FOUND
% 0.92/1.16 *
%------------------------------------------------------------------------------