TSTP Solution File: GRP682+1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : GRP682+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n012.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:18 EDT 2022
% Result : Theorem 0.72s 0.92s
% Output : Refutation 0.72s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 8
% Syntax : Number of clauses : 56 ( 55 unt; 0 nHn; 4 RR)
% Number of literals : 57 ( 56 equ; 4 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 131 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
ld(X,mult(X,X)) = X,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f01) ).
cnf(2,axiom,
rd(mult(X,X),X) = X,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f02) ).
cnf(3,axiom,
mult(X,ld(X,Y)) = ld(X,mult(X,Y)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f03) ).
cnf(4,axiom,
mult(rd(X,Y),Y) = rd(mult(X,Y),Y),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f04) ).
cnf(5,axiom,
ld(ld(X,Y),mult(ld(X,Y),mult(Z,U))) = mult(ld(X,mult(X,Z)),U),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f05) ).
cnf(6,axiom,
rd(mult(mult(X,Y),rd(Z,U)),rd(Z,U)) = mult(X,rd(mult(Y,U),U)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f06) ).
cnf(7,plain,
mult(rd(mult(X,Y),rd(Z,U)),rd(Z,U)) = mult(X,mult(rd(Y,U),U)),
inference('REWRITE',[status(thm)],[6,4,theory(equality)]) ).
cnf(8,axiom,
ld(X,mult(X,ld(Y,Y))) = rd(mult(rd(X,X),Y),Y),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f07) ).
cnf(9,plain,
ld(X,mult(X,ld(Y,Y))) = mult(rd(rd(X,X),Y),Y),
inference('REWRITE',[status(thm)],[8,4,theory(equality)]) ).
cnf(10,negated_conjecture,
( ld(ld('SKOLEMAAAV1','SKOLEMAAAV2'),mult(ld('SKOLEMAAAV1','SKOLEMAAAV2'),'SKOLEMAAAV3')) != ld('SKOLEMAAAV1',mult('SKOLEMAAAV1','SKOLEMAAAV3'))
| ld(rd('SKOLEMAAAV1','SKOLEMAAAV2'),mult(rd('SKOLEMAAAV1','SKOLEMAAAV2'),'SKOLEMAAAV3')) != ld('SKOLEMAAAV1',mult('SKOLEMAAAV1','SKOLEMAAAV3')) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
cnf(11,plain,
mult(rd(X,X),X) = X,
inference('REWRITE',[status(thm)],[2,4,theory(equality)]) ).
cnf(13,plain,
ld(X,X) = rd(X,X),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[4,11,theory(equality)]),1,3,9,theory(equality)]) ).
cnf(14,plain,
ld(X,mult(X,ld(Y,Y))) = mult(rd(ld(X,X),Y),Y),
inference('REWRITE',[status(thm)],[9,13,theory(equality)]) ).
cnf(15,plain,
mult(ld(X,X),X) = X,
inference('REWRITE',[status(thm)],[11,13,theory(equality)]) ).
cnf(16,plain,
mult(rd(X,ld(X,Y)),ld(X,Y)) = rd(ld(X,mult(X,Y)),ld(X,Y)),
inference('PARAMODULATE',[status(thm)],[4,3,theory(equality)]) ).
cnf(18,plain,
ld(X,mult(X,mult(Y,Z))) = mult(ld(X,mult(X,Y)),Z),
inference('PARAMODULATE',[status(thm)],[5,1,theory(equality)]) ).
cnf(20,plain,
ld(ld(X,Y),mult(ld(X,Y),Z)) = mult(ld(X,mult(X,ld(Z,Z))),Z),
inference('PARAMODULATE',[status(thm)],[5,15,theory(equality)]) ).
cnf(26,plain,
ld(ld(X,Y),mult(ld(X,Y),mult(ld(X,Z),U))) = mult(ld(X,ld(X,mult(X,Z))),U),
inference('PARAMODULATE',[status(thm)],[5,3,theory(equality)]) ).
cnf(35,plain,
mult(rd(X,rd(Y,Z)),rd(Y,Z)) = mult(ld(X,X),mult(rd(X,Z),Z)),
inference('PARAMODULATE',[status(thm)],[7,15,theory(equality)]) ).
cnf(36,plain,
mult(ld(mult(X,Y),mult(X,Y)),mult(rd(mult(X,Y),Z),Z)) = mult(X,mult(rd(Y,Z),Z)),
inference('REWRITE',[status(thm)],[7,35,theory(equality)]) ).
cnf(46,plain,
ld(X,mult(X,ld(ld(X,X),ld(X,X)))) = ld(X,X),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[14,13,theory(equality)]),15,theory(equality)]) ).
cnf(52,plain,
ld(X,mult(X,mult(X,Y))) = mult(X,Y),
inference('PARAMODULATE',[status(thm)],[18,1,theory(equality)]) ).
cnf(53,plain,
ld(X,mult(X,Y)) = mult(ld(X,mult(X,ld(Y,Y))),Y),
inference('PARAMODULATE',[status(thm)],[18,15,theory(equality)]) ).
cnf(54,plain,
ld(ld(X,Y),mult(ld(X,Y),Z)) = ld(X,mult(X,Z)),
inference('REWRITE',[status(thm)],[20,53,theory(equality)]) ).
cnf(65,plain,
ld(X,mult(X,mult(ld(X,Y),Z))) = mult(ld(X,ld(X,mult(X,Y))),Z),
inference('REWRITE',[status(thm)],[26,54,theory(equality)]) ).
cnf(69,plain,
ld(rd('SKOLEMAAAV1','SKOLEMAAAV2'),mult(rd('SKOLEMAAAV1','SKOLEMAAAV2'),'SKOLEMAAAV3')) != ld('SKOLEMAAAV1',mult('SKOLEMAAAV1','SKOLEMAAAV3')),
inference('REWRITE',[status(thm)],[10,54,theory(equality)]) ).
cnf(81,plain,
ld(X,ld(X,mult(X,Y))) = ld(X,Y),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[1,54,theory(equality)]),3,theory(equality)]) ).
cnf(83,plain,
ld(X,mult(X,mult(ld(X,Y),Z))) = mult(ld(X,Y),Z),
inference('REWRITE',[status(thm)],[65,81,theory(equality)]) ).
cnf(84,plain,
ld(mult(X,Y),mult(mult(X,Y),Z)) = ld(X,mult(X,Z)),
inference('PARAMODULATE',[status(thm)],[54,52,theory(equality)]) ).
cnf(88,plain,
ld(ld(X,mult(X,Y)),ld(X,mult(X,mult(Y,Z)))) = ld(X,mult(X,Z)),
inference('PARAMODULATE',[status(thm)],[54,18,theory(equality)]) ).
cnf(89,plain,
mult(ld(X,Y),ld(X,mult(X,Z))) = mult(ld(X,Y),Z),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[3,54,theory(equality)]),83,54,theory(equality)]) ).
cnf(90,plain,
ld(ld(X,Y),ld(X,mult(X,Z))) = ld(X,mult(X,ld(ld(X,Y),Z))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[54,3,theory(equality)]),54,theory(equality)]) ).
cnf(91,plain,
ld(ld(X,X),ld(X,X)) = ld(X,X),
inference('REWRITE',[status(thm)],[46,1,3,90,theory(equality)]) ).
cnf(94,plain,
ld(ld(X,Y),ld(X,mult(X,Z))) = ld(ld(X,Y),Z),
inference('PARAMODULATE',[status(thm)],[81,54,theory(equality)]) ).
cnf(95,plain,
ld(ld(X,mult(X,Y)),mult(Y,Z)) = ld(X,mult(X,Z)),
inference('REWRITE',[status(thm)],[88,94,theory(equality)]) ).
cnf(116,plain,
ld(X,ld(ld(X,mult(X,Y)),mult(Y,Z))) = ld(X,Z),
inference('PARAMODULATE',[status(thm)],[81,95,theory(equality)]) ).
cnf(121,plain,
ld(ld(X,mult(X,Y)),ld(Y,mult(Y,Z))) = ld(X,mult(X,ld(Y,Z))),
inference('PARAMODULATE',[status(thm)],[95,3,theory(equality)]) ).
cnf(138,plain,
ld(ld(rd('SKOLEMAAAV1','SKOLEMAAAV2'),mult(rd('SKOLEMAAAV1','SKOLEMAAAV2'),X)),mult(X,'SKOLEMAAAV3')) != ld('SKOLEMAAAV1',mult('SKOLEMAAAV1','SKOLEMAAAV3')),
inference('PARAMODULATE',[status(thm)],[69,95,theory(equality)]) ).
cnf(142,plain,
mult(X,ld(ld(X,mult(X,Y)),mult(Y,Z))) = mult(X,Z),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[3,95,theory(equality)]),52,theory(equality)]) ).
cnf(145,plain,
ld(ld(ld(X,mult(X,Y)),ld(Y,mult(Y,Z))),mult(ld(Y,Z),U)) = ld(ld(X,mult(X,Y)),mult(Y,U)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[95,89,theory(equality)]),52,121,theory(equality)]) ).
cnf(291,plain,
ld(X,Y) = ld(X,ld(Z,mult(Z,Y))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[116,89,theory(equality)]),116,145,121,theory(equality)]) ).
cnf(305,plain,
ld(ld(X,mult(X,Y)),Z) = ld(X,mult(X,ld(Y,Z))),
inference('REWRITE',[status(thm)],[121,291,theory(equality)]) ).
cnf(324,plain,
mult(X,ld(ld(X,mult(X,Y)),Z)) = mult(X,ld(Y,Z)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[3,305,theory(equality)]),52,theory(equality)]) ).
cnf(325,plain,
mult(X,ld(Y,mult(Y,Z))) = mult(X,Z),
inference('REWRITE',[status(thm)],[142,324,theory(equality)]) ).
cnf(347,plain,
mult(X,ld(ld(mult(Y,Z),mult(Y,Z)),mult(Y,mult(rd(Z,U),U)))) = mult(X,mult(rd(mult(Y,Z),U),U)),
inference('PARAMODULATE',[status(thm)],[325,36,theory(equality)]) ).
cnf(367,plain,
mult(rd(X,ld(X,X)),ld(X,X)) = rd(X,ld(X,X)),
inference('PARAMODULATE',[status(thm)],[16,1,theory(equality)]) ).
cnf(398,plain,
mult(rd(X,ld(Y,Y)),ld(Y,Y)) = mult(ld(X,X),mult(rd(X,Y),Y)),
inference('PARAMODULATE',[status(thm)],[35,13,theory(equality)]) ).
cnf(400,plain,
X = rd(X,ld(X,X)),
inference('REWRITE',[status(thm)],[367,15,13,398,theory(equality)]) ).
cnf(406,plain,
rd(X,Y) = mult(ld(rd(X,Y),rd(X,Y)),mult(rd(rd(X,Y),Y),Y)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[35,13,theory(equality)]),15,theory(equality)]) ).
cnf(414,plain,
mult(mult(ld(X,X),mult(rd(X,Y),Y)),rd(Z,Y)) = mult(X,mult(rd(rd(Z,Y),Y),Y)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[35,4,theory(equality)]),52,84,54,3,347,35,theory(equality)]) ).
cnf(428,plain,
mult(rd(X,Y),Y) = mult(ld(X,X),mult(ld(X,X),mult(rd(X,Y),Y))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[35,400,theory(equality)]),398,theory(equality)]) ).
cnf(581,plain,
mult(ld(X,X),mult(rd(X,Y),Y)) = mult(rd(X,Y),Y),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[398,91,theory(equality)]),428,398,theory(equality)]) ).
cnf(587,plain,
rd(X,Y) = mult(rd(rd(X,Y),Y),Y),
inference('REWRITE',[status(thm)],[406,581,theory(equality)]) ).
cnf(637,plain,
mult(mult(rd(X,Y),Y),rd(Z,Y)) = mult(X,rd(Z,Y)),
inference('REWRITE',[status(thm)],[414,587,581,theory(equality)]) ).
cnf(756,plain,
ld(X,mult(X,Y)) = ld(rd(X,Z),mult(rd(X,Z),Y)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[84,637,theory(equality)]),84,theory(equality)]) ).
cnf(778,plain,
$false,
inference('REWRITE',[status(thm)],[138,95,756,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : GRP682+1 : TPTP v8.1.0. Released v4.0.0.
% 0.12/0.14 % Command : run-snark %s %d
% 0.13/0.35 % Computer : n012.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Tue Jun 14 04:25:10 EDT 2022
% 0.13/0.36 % CPUTime :
% 0.20/0.48 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.49 *
% 0.20/0.49 *
% 0.20/0.50 #<PACKAGE "SNARK-USER">
% 0.20/0.50 *
% 0.20/0.50 SNARK-TPTP-OPTIONS
% 0.20/0.50 *
% 0.20/0.50 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.20/0.50 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.20/0.50 (USE-FACTORING :POS)
% 0.20/0.50 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.20/0.50 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.20/0.50 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.20/0.50 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.20/0.50 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.20/0.50 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.20/0.50 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.20/0.50 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.20/0.50 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.20/0.50 (DECLARE-TPTP-SYMBOLS2))
% 0.20/0.50 *
% 0.20/0.50 "."
% 0.20/0.50 *
% 0.20/0.50 ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-14T04:25:10
% 0.20/0.50 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n012.cluster.edu at 2022-06-14T04:25:10
% 0.72/0.92
% 0.72/0.92
% 0.72/0.92 #||
% 0.72/0.92 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.72/0.92 % SZS output start Refutation
% See solution above
% 0.72/0.92 ||#
% 0.72/0.92
% 0.72/0.92 ; Summary of computation:
% 0.72/0.92 ; 2334 formulas have been input or derived (from 64 formulas).
% 0.72/0.92 ; 778 (33%) were retained. Of these,
% 0.72/0.92 ; 499 (64%) were simplified or subsumed later,
% 0.72/0.92 ; 279 (36%) are still being kept.
% 0.72/0.92 ;
% 0.72/0.92 ; Run time in seconds excluding printing time:
% 0.72/0.92 ; 0.003 1% Read assertion file (1 call)
% 0.72/0.92 ; 0.000 0% Assert (8 calls)
% 0.72/0.92 ; 0.097 23% Process new row (2,291 calls)
% 0.72/0.92 ; 0.003 1% Resolution (126 calls)
% 0.72/0.92 ; 0.043 10% Paramodulation (63 calls)
% 0.72/0.92 ; 0.000 0% Condensing (1 call)
% 0.72/0.92 ; 0.000 0% Forward subsumption (1 call)
% 0.72/0.92 ; 0.000 0% Backward subsumption (1 call)
% 0.72/0.92 ; 0.121 29% Forward simplification (2,093 calls)
% 0.72/0.92 ; 0.065 15% Backward simplification (776 calls)
% 0.72/0.92 ; 0.056 13% Ordering (7,561 calls)
% 0.72/0.92 ; 0.000 0% Sortal reasoning (32 calls)
% 0.72/0.92 ; 0.000 0% Purity testing (1 call)
% 0.72/0.92 ; 0.033 8% Other
% 0.72/0.92 ; 0.421 Total
% 0.72/0.92 ; 0.426 Real time
% 0.72/0.92 ;
% 0.72/0.92 ; Term-hash-array has 2,581 terms in all.
% 0.72/0.92 ; Feature-vector-row-index has 0 entries (1 at peak, 1 added, 1 deleted).
% 0.72/0.92 ; Feature-vector-row-index has 1 node (21 at peak, 21 added, 20 deleted).
% 0.72/0.92 ; Retrieved 0 possibly forward subsuming rows in 1 call.
% 0.72/0.92 ; Retrieved 0 possibly backward subsumed rows in 1 call.
% 0.72/0.92 ; Path-index has 1,041 entries (1,185 at peak, 2,966 added, 1,925 deleted).
% 0.72/0.92 ; Path-index has 6,373 nodes (6,636 at peak, 9,551 added, 3,178 deleted).
% 0.72/0.92 ; Trie-index has 1,041 entries (1,185 at peak, 2,966 added, 1,925 deleted).
% 0.72/0.92 ; Trie-index has 6,826 nodes (8,487 at peak, 21,917 added, 15,091 deleted).
% 0.72/0.92 ; Retrieved 23,828 generalization terms in 25,125 calls.
% 0.72/0.92 ; Retrieved 2,389 instance terms in 952 calls.
% 0.72/0.92 ; Retrieved 5,281 unifiable terms in 432 calls.
% 0.72/0.92 ;
% 0.72/0.92 ; The agenda of backward simplifiable rows to process has 2 entries:
% 0.72/0.92 ; 2 with value 0
% 0.72/0.92 ; The agenda of rows to process has 23 entries:
% 0.72/0.92 ; 1 with value 36 4 with value 40 1 with value 44
% 0.72/0.92 ; 5 with value 37 3 with value 41 1 with value 46
% 0.72/0.92 ; 1 with value 38 1 with value 42 1 with value 47
% 0.72/0.92 ; 3 with value 39 1 with value 43 1 with value 56
% 0.72/0.92 ; The agenda of rows to give has 241 entries:
% 0.72/0.92 ; 1 with value (4 19) 16 with value (4 31) 9 with value (4 43)
% 0.72/0.92 ; 1 with value (4 20) 25 with value (4 32) 3 with value (4 44)
% 0.72/0.92 ; 2 with value (4 21) 15 with value (4 33) 1 with value (4 45)
% 0.72/0.92 ; 5 with value (4 22) 15 with value (4 34) 2 with value (4 46)
% 0.72/0.92 ; 5 with value (4 23) 11 with value (4 35) 3 with value (4 47)
% 0.72/0.92 ; 1 with value (4 24) 8 with value (4 36) 2 with value (4 48)
% 0.72/0.92 ; 3 with value (4 25) 5 with value (4 37) 1 with value (4 49)
% 0.72/0.92 ; 9 with value (4 26) 7 with value (4 38) 2 with value (4 52)
% 0.72/0.92 ; 14 with value (4 27) 4 with value (4 39) 1 with value (4 55)
% 0.72/0.92 ; 15 with value (4 28) 3 with value (4 40) 1 with value (4 62)
% 0.72/0.92 ; 15 with value (4 29) 11 with value (4 41) 1 with value (4 66)
% 0.72/0.92 ; 15 with value (4 30) 8 with value (4 42) 1 with value (4 84)
% 0.72/0.92 Evaluation took:
% 0.72/0.92 0.427 seconds of real time
% 0.72/0.92 0.394163 seconds of user run time
% 0.72/0.92 0.032953 seconds of system run time
% 0.72/0.92 [Run times include 0.022 seconds GC run time.]
% 0.72/0.92 0 calls to %EVAL
% 0.72/0.92 0 page faults and
% 0.72/0.92 32,051,392 bytes consed.
% 0.72/0.92 :PROOF-FOUND
% 0.72/0.92 ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-14T04:25:11
% 0.72/0.92 :PROOF-FOUND
% 0.72/0.92 *
%------------------------------------------------------------------------------