TSTP Solution File: GRP711+1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : GRP711+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n027.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:29 EDT 2022
% Result : Theorem 0.48s 0.64s
% Output : Refutation 0.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 7
% Syntax : Number of clauses : 21 ( 20 unt; 1 nHn; 4 RR)
% Number of literals : 22 ( 21 equ; 1 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 31 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
mult(X,unit) = X,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f01) ).
cnf(2,axiom,
mult(unit,X) = X,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f02) ).
cnf(3,axiom,
mult(X,mult(Y,mult(Y,Z))) = mult(mult(mult(X,Y),Y),Z),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f03) ).
cnf(4,axiom,
mult(X,i(X)) = unit,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f04) ).
cnf(5,axiom,
mult(i(X),X) = unit,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f05) ).
cnf(6,negated_conjecture,
( mult('SKOLEMAAAV1','SKOLEMAAAV2') = mult('SKOLEMAAAV1','SKOLEMAAAV3')
| mult('SKOLEMAAAV2','SKOLEMAAAV1') = mult('SKOLEMAAAV3','SKOLEMAAAV1') ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
cnf(9,negated_conjecture,
'SKOLEMAAAV2' != 'SKOLEMAAAV3',
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
cnf(11,plain,
mult(mult(X,X),Y) = mult(X,mult(X,Y)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[2,3,theory(equality)]),2,theory(equality)]) ).
cnf(12,plain,
mult(X,mult(Y,Y)) = mult(mult(X,Y),Y),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[1,3,theory(equality)]),1,theory(equality)]) ).
cnf(13,plain,
mult(X,Y) = mult(mult(mult(X,Y),Y),i(Y)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[3,4,theory(equality)]),1,theory(equality)]) ).
cnf(14,plain,
mult(i(X),mult(X,mult(X,Y))) = mult(X,Y),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[3,5,theory(equality)]),2,theory(equality)]) ).
cnf(17,plain,
mult(X,i(Y)) = mult(mult(mult(X,i(Y)),i(Y)),Y),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[3,5,theory(equality)]),1,theory(equality)]) ).
cnf(49,plain,
mult(i(X),mult(X,X)) = X,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[12,5,theory(equality)]),2,theory(equality)]) ).
cnf(69,plain,
X = mult(mult(mult(X,i(Y)),i(Y)),mult(Y,Y)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[3,49,theory(equality)]),1,5,theory(equality)]) ).
cnf(84,plain,
mult(mult(i(X),i(X)),mult(X,mult(X,Y))) = mult(i(X),mult(X,Y)),
inference('PARAMODULATE',[status(thm)],[11,14,theory(equality)]) ).
cnf(162,plain,
X = mult(mult(X,i(Y)),Y),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[12,17,theory(equality)]),69,theory(equality)]) ).
cnf(163,plain,
X = mult(mult(X,Y),i(Y)),
inference('PARAMODULATE',[status(thm)],[13,162,theory(equality)]) ).
cnf(175,plain,
mult(mult(X,i(Y)),mult(Y,mult(Y,Z))) = mult(mult(X,Y),Z),
inference('PARAMODULATE',[status(thm)],[3,162,theory(equality)]) ).
cnf(179,plain,
X = mult(i(Y),mult(Y,X)),
inference('REWRITE',[status(thm)],[84,2,5,175,theory(equality)]) ).
cnf(192,plain,
mult('SKOLEMAAAV2','SKOLEMAAAV1') = mult('SKOLEMAAAV3','SKOLEMAAAV1'),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[179,6,theory(equality)]),9,179,theory(equality)]) ).
cnf(201,plain,
$false,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[163,192,theory(equality)]),9,163,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : GRP711+1 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.14 % Command : run-snark %s %d
% 0.15/0.35 % Computer : n027.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 600
% 0.15/0.35 % DateTime : Mon Jun 13 09:28:17 EDT 2022
% 0.15/0.36 % CPUTime :
% 0.22/0.48 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.22/0.49 *
% 0.22/0.49 *
% 0.22/0.49 #<PACKAGE "SNARK-USER">
% 0.22/0.49 *
% 0.22/0.49 SNARK-TPTP-OPTIONS
% 0.22/0.49 *
% 0.22/0.49 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.22/0.49 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.22/0.49 (USE-FACTORING :POS)
% 0.22/0.49 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.22/0.49 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.22/0.49 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.22/0.49 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.22/0.49 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.22/0.49 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.22/0.49 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.22/0.49 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.22/0.49 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.22/0.49 (DECLARE-TPTP-SYMBOLS2))
% 0.22/0.49 *
% 0.22/0.49 "."
% 0.22/0.49 *
% 0.22/0.49 ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-13T09:28:17
% 0.22/0.49 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n027.cluster.edu at 2022-06-13T09:28:17
% 0.22/0.51
% 0.22/0.51 ; Recognized right identity assertion (= (|mult| ?X |unit|) ?X).
% 0.22/0.51 ; Recognized left identity assertion (= (|mult| |unit| ?X) ?X).
% 0.22/0.51 ; Recognized possible right inverse assertion (= (|mult| ?X (|i| ?X)) |unit|).
% 0.48/0.64 ; Recognized possible left inverse assertion (= (|mult| (|i| ?X) ?X) |unit|).
% 0.48/0.64
% 0.48/0.64 #||
% 0.48/0.64 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.48/0.64 % SZS output start Refutation
% See solution above
% 0.48/0.65 ||#
% 0.48/0.65
% 0.48/0.65 ; Summary of computation:
% 0.48/0.65 ; 697 formulas have been input or derived (from 31 formulas).
% 0.48/0.65 ; 201 (29%) were retained. Of these,
% 0.48/0.65 ; 108 (54%) were simplified or subsumed later,
% 0.48/0.65 ; 93 (46%) are still being kept.
% 0.48/0.65 ;
% 0.48/0.65 ; Run time in seconds excluding printing time:
% 0.48/0.65 ; 0.002 1% Read assertion file (1 call)
% 0.48/0.65 ; 0.000 0% Assert (6 calls)
% 0.48/0.65 ; 0.025 17% Process new row (652 calls)
% 0.48/0.65 ; 0.002 1% Resolution (60 calls)
% 0.48/0.65 ; 0.014 9% Paramodulation (30 calls)
% 0.48/0.65 ; 0.000 0% Factoring (1 call)
% 0.48/0.65 ; 0.000 0% Condensing (15 calls)
% 0.48/0.65 ; 0.002 1% Forward subsumption (15 calls)
% 0.48/0.65 ; 0.001 1% Backward subsumption (15 calls)
% 0.48/0.65 ; 0.000 0% Clause clause subsumption (22 calls)
% 0.48/0.65 ; 0.041 27% Forward simplification (636 calls)
% 0.48/0.65 ; 0.007 5% Backward simplification (201 calls)
% 0.48/0.65 ; 0.029 19% Ordering (3,985 calls)
% 0.48/0.65 ; 0.000 0% Sortal reasoning (32 calls)
% 0.48/0.65 ; 0.001 1% Purity testing (1 call)
% 0.48/0.65 ; 0.026 17% Other
% 0.48/0.65 ; 0.150 Total
% 0.48/0.65 ; 0.151 Real time
% 0.48/0.65 ;
% 0.48/0.65 ; Term-hash-array has 597 terms in all.
% 0.48/0.65 ; Feature-vector-row-index has 0 entries (13 at peak, 15 added, 15 deleted).
% 0.48/0.65 ; Feature-vector-row-index has 1 node (83 at peak, 98 added, 97 deleted).
% 0.48/0.65 ; Retrieved 15 possibly forward subsuming rows in 15 calls.
% 0.48/0.65 ; Retrieved 7 possibly backward subsumed rows in 15 calls.
% 0.48/0.65 ; Path-index has 332 entries (475 at peak, 628 added, 296 deleted).
% 0.48/0.65 ; Path-index has 687 nodes (749 at peak, 827 added, 140 deleted).
% 0.48/0.65 ; Trie-index has 332 entries (475 at peak, 628 added, 296 deleted).
% 0.48/0.65 ; Trie-index has 1,482 nodes (2,389 at peak, 3,066 added, 1,584 deleted).
% 0.48/0.65 ; Retrieved 10,674 generalization terms in 4,334 calls.
% 0.48/0.65 ; Retrieved 1,267 instance terms in 275 calls.
% 0.48/0.65 ; Retrieved 2,443 unifiable terms in 191 calls.
% 0.48/0.65 ;
% 0.48/0.65 ; The agenda of rows to process has 23 entries:
% 0.48/0.65 ; 1 with value 15 4 with value 20 2 with value 25
% 0.48/0.65 ; 4 with value 16 2 with value 21 1 with value 27
% 0.48/0.65 ; 4 with value 17 2 with value 22 1 with value 29
% 0.48/0.65 ; 1 with value 19 1 with value 24
% 0.48/0.65 ; The agenda of rows to give has 74 entries:
% 0.48/0.65 ; 1 with value (4 15) 3 with value (4 23) 1 with value (4 31)
% 0.48/0.65 ; 1 with value (4 16) 5 with value (4 24) 1 with value (4 32)
% 0.48/0.65 ; 2 with value (4 17) 9 with value (4 25) 1 with value (4 33)
% 0.48/0.65 ; 1 with value (4 18) 6 with value (4 26) 2 with value (4 34)
% 0.48/0.65 ; 3 with value (4 19) 3 with value (4 27) 1 with value (4 36)
% 0.48/0.65 ; 3 with value (4 20) 2 with value (4 28) 2 with value (4 37)
% 0.48/0.65 ; 13 with value (4 21) 2 with value (4 29) 2 with value (4 38)
% 0.48/0.65 ; 1 with value (4 22) 7 with value (4 30) 2 with value (4 47)
% 0.48/0.65 Evaluation took:
% 0.48/0.65 0.152 seconds of real time
% 0.48/0.65 0.130082 seconds of user run time
% 0.48/0.65 0.021973 seconds of system run time
% 0.48/0.65 0 calls to %EVAL
% 0.48/0.65 0 page faults and
% 0.48/0.65 9,074,528 bytes consed.
% 0.48/0.65 :PROOF-FOUND
% 0.48/0.65 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-13T09:28:17
% 0.48/0.65 :PROOF-FOUND
% 0.48/0.65 *
%------------------------------------------------------------------------------