%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : GRP658+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n005.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:08 EDT 2022
% Result : Theorem 1.75s 1.98s
% Output : Refutation 1.83s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 6
% Syntax : Number of clauses : 63 ( 62 unt; 0 nHn; 4 RR)
% Number of literals : 64 ( 63 equ; 4 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 0 con; 1-2 aty)
% Number of variables : 145 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
mult(X,ld(X,Y)) = Y,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f01) ).
cnf(2,axiom,
ld(X,mult(X,Y)) = Y,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f02) ).
cnf(3,axiom,
mult(rd(X,Y),Y) = X,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f03) ).
cnf(4,axiom,
rd(mult(X,Y),Y) = X,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f04) ).
cnf(5,axiom,
mult(mult(X,mult(Y,Y)),Z) = mult(mult(X,Y),mult(Y,Z)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f05) ).
cnf(6,negated_conjecture,
( mult('SKOLEMAAAV1'(X),X) != 'SKOLEMAAAV1'(X)
| mult(X,'SKOLEMAAAV1'(X)) != 'SKOLEMAAAV1'(X) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
cnf(8,plain,
rd(X,ld(Y,X)) = Y,
inference('PARAMODULATE',[status(thm)],[4,1,theory(equality)]) ).
cnf(9,plain,
rd(mult(mult(X,Y),mult(Y,Z)),Z) = mult(X,mult(Y,Y)),
inference('PARAMODULATE',[status(thm)],[4,5,theory(equality)]) ).
cnf(10,plain,
ld(mult(X,mult(Y,Y)),mult(mult(X,Y),mult(Y,Z))) = Z,
inference('PARAMODULATE',[status(thm)],[2,5,theory(equality)]) ).
cnf(12,plain,
mult(mult(X,mult(Y,Y)),ld(Y,Z)) = mult(mult(X,Y),Z),
inference('PARAMODULATE',[status(thm)],[5,1,theory(equality)]) ).
cnf(13,plain,
rd(mult(mult(X,mult(Y,Y)),Z),mult(Y,Z)) = mult(X,Y),
inference('PARAMODULATE',[status(thm)],[4,5,theory(equality)]) ).
cnf(14,plain,
ld(mult(X,Y),mult(mult(X,mult(Y,Y)),Z)) = mult(Y,Z),
inference('PARAMODULATE',[status(thm)],[2,5,theory(equality)]) ).
cnf(15,plain,
mult(X,Y) = mult(mult(rd(X,mult(Z,Z)),Z),mult(Z,Y)),
inference('PARAMODULATE',[status(thm)],[5,3,theory(equality)]) ).
cnf(23,plain,
rd(mult(X,mult(Y,Z)),Z) = mult(rd(X,Y),mult(Y,Y)),
inference('PARAMODULATE',[status(thm)],[9,3,theory(equality)]) ).
cnf(25,plain,
ld(mult(X,mult(Y,Y)),mult(mult(X,Y),Z)) = ld(Y,Z),
inference('PARAMODULATE',[status(thm)],[10,1,theory(equality)]) ).
cnf(40,plain,
mult(X,ld(Y,Z)) = mult(mult(rd(X,mult(Y,Y)),Y),Z),
inference('PARAMODULATE',[status(thm)],[12,3,theory(equality)]) ).
cnf(46,plain,
rd(mult(X,Y),mult(Z,Y)) = mult(rd(X,mult(Z,Z)),Z),
inference('PARAMODULATE',[status(thm)],[13,3,theory(equality)]) ).
cnf(59,plain,
ld(mult(X,ld(Y,Y)),mult(mult(X,Y),Z)) = mult(Y,Z),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[14,15,theory(equality)]),40,theory(equality)]) ).
cnf(60,plain,
mult(mult(X,Y),ld(Y,Z)) = mult(mult(X,ld(Y,Y)),Z),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[12,15,theory(equality)]),40,theory(equality)]) ).
cnf(74,plain,
rd(mult(X,Y),ld(Z,Y)) = mult(rd(X,Z),mult(Z,Z)),
inference('PARAMODULATE',[status(thm)],[23,1,theory(equality)]) ).
cnf(76,plain,
rd(mult(X,Y),Z) = mult(rd(X,rd(Y,Z)),mult(rd(Y,Z),rd(Y,Z))),
inference('PARAMODULATE',[status(thm)],[23,3,theory(equality)]) ).
cnf(112,plain,
ld(X,mult(rd(mult(X,Y),mult(Z,Y)),U)) = ld(Z,U),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[25,46,theory(equality)]),3,theory(equality)]) ).
cnf(135,plain,
ld(X,mult(mult(X,X),Y)) = mult(X,Y),
inference('PARAMODULATE',[status(thm)],[59,1,theory(equality)]) ).
cnf(138,plain,
ld(X,mult(mult(rd(X,ld(Y,Y)),Y),Z)) = mult(Y,Z),
inference('PARAMODULATE',[status(thm)],[59,3,theory(equality)]) ).
cnf(157,plain,
mult(X,mult(X,Y)) = mult(mult(X,X),Y),
inference('PARAMODULATE',[status(thm)],[1,135,theory(equality)]) ).
cnf(163,plain,
mult(X,Y) = mult(mult(X,X),ld(X,Y)),
inference('PARAMODULATE',[status(thm)],[157,1,theory(equality)]) ).
cnf(166,plain,
mult(rd(X,X),mult(X,X)) = mult(X,X),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[4,157,theory(equality)]),23,theory(equality)]) ).
cnf(217,plain,
ld(mult(X,X),mult(X,Y)) = ld(X,Y),
inference('PARAMODULATE',[status(thm)],[2,163,theory(equality)]) ).
cnf(231,plain,
mult(rd(X,mult(X,X)),X) = rd(X,X),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[4,166,theory(equality)]),46,theory(equality)]) ).
cnf(292,plain,
X = mult(mult(rd(Y,Y),ld(Y,Y)),X),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[60,166,theory(equality)]),217,1,theory(equality)]) ).
cnf(345,plain,
rd(X,ld(Y,Z)) = mult(rd(rd(X,Z),Y),mult(Y,Y)),
inference('PARAMODULATE',[status(thm)],[74,3,theory(equality)]) ).
cnf(393,plain,
rd(mult(X,Y),mult(X,Y)) = rd(X,X),
inference('PARAMODULATE',[status(thm)],[46,231,theory(equality)]) ).
cnf(400,plain,
ld(mult(rd(X,mult(X,X)),ld(X,X)),mult(rd(X,X),Y)) = mult(X,Y),
inference('PARAMODULATE',[status(thm)],[59,231,theory(equality)]) ).
cnf(405,plain,
rd(mult(X,rd(Y,Y)),Y) = mult(rd(X,rd(Y,mult(Y,Y))),mult(rd(Y,mult(Y,Y)),rd(Y,mult(Y,Y)))),
inference('PARAMODULATE',[status(thm)],[23,231,theory(equality)]) ).
cnf(408,plain,
mult(rd(X,X),Y) = mult(mult(rd(mult(X,X),mult(mult(X,X),mult(X,X))),X),mult(X,Y)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[5,231,theory(equality)]),393,theory(equality)]) ).
cnf(412,plain,
ld(rd(X,X),mult(mult(rd(mult(X,X),mult(mult(X,X),mult(X,X))),X),Y)) = ld(X,Y),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[25,231,theory(equality)]),393,theory(equality)]) ).
cnf(422,plain,
ld(mult(rd(X,X),ld(X,X)),Y) = Y,
inference('PARAMODULATE',[status(thm)],[1,292,theory(equality)]) ).
cnf(425,plain,
ld(mult(rd(X,X),mult(ld(X,X),ld(X,X))),Y) = ld(ld(X,X),Y),
inference('PARAMODULATE',[status(thm)],[25,292,theory(equality)]) ).
cnf(429,plain,
X = mult(ld(Y,Y),X),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[60,292,theory(equality)]),292,1,theory(equality)]) ).
cnf(433,plain,
X = ld(ld(Y,Y),X),
inference('REWRITE',[status(thm)],[425,422,429,theory(equality)]) ).
cnf(438,plain,
rd(X,X) = ld(Y,Y),
inference('PARAMODULATE',[status(thm)],[4,429,theory(equality)]) ).
cnf(439,plain,
mult('SKOLEMAAAV1'(ld(X,X)),ld(X,X)) != 'SKOLEMAAAV1'(ld(X,X)),
inference('UR-RESOLVE',[status(thm)],[6,429]) ).
cnf(444,plain,
mult(X,rd(Y,Y)) = X,
inference('PARAMODULATE',[status(thm)],[1,438,theory(equality)]) ).
cnf(445,plain,
rd(X,Y) = mult(rd(X,rd(Y,mult(Y,Y))),mult(rd(Y,mult(Y,Y)),rd(Y,mult(Y,Y)))),
inference('REWRITE',[status(thm)],[405,444,theory(equality)]) ).
cnf(446,plain,
rd(X,rd(Y,Y)) = X,
inference('PARAMODULATE',[status(thm)],[8,438,theory(equality)]) ).
cnf(449,plain,
X = ld(rd(Y,Y),X),
inference('PARAMODULATE',[status(thm)],[433,438,theory(equality)]) ).
cnf(450,plain,
mult(mult(rd(mult(X,X),mult(mult(X,X),mult(X,X))),X),Y) = ld(X,Y),
inference('REWRITE',[status(thm)],[412,449,theory(equality)]) ).
cnf(451,plain,
mult(rd(X,X),Y) = Y,
inference('REWRITE',[status(thm)],[408,2,450,theory(equality)]) ).
cnf(452,plain,
ld(mult(rd(X,mult(X,X)),ld(X,X)),Y) = mult(X,Y),
inference('REWRITE',[status(thm)],[400,451,theory(equality)]) ).
cnf(458,plain,
mult(X,Y) = mult(rd(X,Y),mult(Y,Y)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[74,438,theory(equality)]),446,theory(equality)]) ).
cnf(483,plain,
rd(X,Y) = mult(X,rd(Y,mult(Y,Y))),
inference('REWRITE',[status(thm)],[445,458,theory(equality)]) ).
cnf(494,plain,
rd(mult(X,Y),Z) = mult(X,rd(Y,Z)),
inference('REWRITE',[status(thm)],[76,458,theory(equality)]) ).
cnf(565,plain,
ld(X,mult(mult(X,rd(Y,mult(Z,Y))),U)) = ld(Z,U),
inference('REWRITE',[status(thm)],[112,494,theory(equality)]) ).
cnf(581,plain,
rd(X,ld(Y,Z)) = mult(rd(X,Z),Y),
inference('REWRITE',[status(thm)],[345,458,theory(equality)]) ).
cnf(589,plain,
ld(X,mult(mult(X,Y),Z)) = mult(Y,Z),
inference('REWRITE',[status(thm)],[138,3,581,theory(equality)]) ).
cnf(590,plain,
mult(rd(X,mult(Y,X)),Z) = ld(Y,Z),
inference('REWRITE',[status(thm)],[565,589,theory(equality)]) ).
cnf(597,plain,
ld(ld(X,ld(X,X)),Y) = mult(X,Y),
inference('REWRITE',[status(thm)],[452,590,theory(equality)]) ).
cnf(598,plain,
ld(ld('SKOLEMAAAV1'(ld(X,X)),ld('SKOLEMAAAV1'(ld(X,X)),'SKOLEMAAAV1'(ld(X,X)))),ld(X,X)) != 'SKOLEMAAAV1'(ld(X,X)),
inference('REWRITE',[status(thm)],[439,597,theory(equality)]) ).
cnf(599,plain,
ld(ld(X,ld(X,X)),ld(X,Y)) = Y,
inference('REWRITE',[status(thm)],[1,597,theory(equality)]) ).
cnf(602,plain,
rd(X,ld(Y,Z)) = ld(ld(rd(X,Z),ld(rd(X,Z),rd(X,Z))),Y),
inference('REWRITE',[status(thm)],[581,597,theory(equality)]) ).
cnf(740,plain,
rd(X,Y) = ld(ld(X,ld(X,X)),ld(Y,ld(Y,Y))),
inference('REWRITE',[status(thm)],[483,449,602,597,theory(equality)]) ).
cnf(750,plain,
ld(ld(X,ld(X,X)),ld(Y,Y)) = X,
inference('REWRITE',[status(thm)],[446,433,599,740,theory(equality)]) ).
cnf(753,plain,
$false,
inference('REWRITE',[status(thm)],[598,750,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.14 % Problem : GRP658+1 : TPTP v8.1.0. Released v4.0.0.
% 0.12/0.15 % Command : run-snark %s %d
% 0.15/0.36 % Computer : n005.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 600
% 0.15/0.36 % DateTime : Tue Jun 14 01:27:39 EDT 2022
% 0.15/0.36 % CPUTime :
% 0.21/0.49 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.50 *
% 0.21/0.50 *
% 0.21/0.51 #<PACKAGE "SNARK-USER">
% 0.21/0.51 *
% 0.21/0.51 SNARK-TPTP-OPTIONS
% 0.21/0.51 *
% 0.21/0.51 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.21/0.51 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.21/0.51 (USE-FACTORING :POS)
% 0.21/0.51 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.21/0.51 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.21/0.51 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.21/0.51 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.21/0.51 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.21/0.51 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.21/0.51 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.21/0.51 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.21/0.51 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.21/0.51 (DECLARE-TPTP-SYMBOLS2))
% 0.21/0.51 *
% 0.21/0.51 "."
% 0.21/0.51 *
% 0.21/0.51 ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-14T01:27:39
% 0.21/0.51 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n005.cluster.edu at 2022-06-14T01:27:39
% 1.75/1.98
% 1.75/1.98
% 1.75/1.98 #||
% 1.75/1.98 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.75/1.98 % SZS output start Refutation
% See solution above
% 1.83/2.01 ||#
% 1.83/2.01
% 1.83/2.01 ; Summary of computation:
% 1.83/2.01 ; 1744 formulas have been input or derived (from 37 formulas).
% 1.83/2.01 ; 753 (43%) were retained. Of these,
% 1.83/2.01 ; 690 (92%) were simplified or subsumed later,
% 1.83/2.01 ; 63 ( 8%) are still being kept.
% 1.83/2.01 ;
% 1.83/2.01 ; Run time in seconds excluding printing time:
% 1.83/2.01 ; 0.001 0% Read assertion file (1 call)
% 1.83/2.01 ; 0.001 0% Assert (6 calls)
% 1.83/2.01 ; 0.154 11% Process new row (1,484 calls)
% 1.83/2.01 ; 0.001 0% Resolution (72 calls)
% 1.83/2.01 ; 0.026 2% Paramodulation (36 calls)
% 1.83/2.01 ; 0.000 0% Condensing (9 calls)
% 1.83/2.01 ; 0.000 0% Forward subsumption (9 calls)
% 1.83/2.01 ; 0.000 0% Backward subsumption (5 calls)
% 1.83/2.01 ; 0.000 0% Clause clause subsumption (5 calls)
% 1.83/2.01 ; 0.144 10% Forward simplification (1,416 calls)
% 1.83/2.01 ; 0.136 9% Backward simplification (753 calls)
% 1.83/2.01 ; 0.976 67% Ordering (22,645 calls)
% 1.83/2.01 ; 0.001 0% Sortal reasoning (32 calls)
% 1.83/2.01 ; 0.000 0% Purity testing (1 call)
% 1.83/2.01 ; 0.025 2% Other
% 1.83/2.01 ; 1.465 Total
% 1.83/2.01 ; 1.495 Real time
% 1.83/2.01 ;
% 1.83/2.01 ; Term-hash-array has 2,592 terms in all.
% 1.83/2.01 ; Feature-vector-row-index has 0 entries (2 at peak, 5 added, 5 deleted).
% 1.83/2.01 ; Feature-vector-row-index has 1 node (24 at peak, 46 added, 45 deleted).
% 1.83/2.01 ; Retrieved 5 possibly forward subsuming rows in 9 calls.
% 1.83/2.01 ; Retrieved 0 possibly backward subsumed rows in 5 calls.
% 1.83/2.01 ; Path-index has 337 entries (1,296 at peak, 2,865 added, 2,528 deleted).
% 1.83/2.01 ; Path-index has 16,830 nodes (19,267 at peak, 25,222 added, 8,392 deleted).
% 1.83/2.01 ; Trie-index has 337 entries (1,296 at peak, 2,865 added, 2,528 deleted).
% 1.83/2.01 ; Trie-index has 12,679 nodes (25,392 at peak, 63,768 added, 51,089 deleted).
% 1.83/2.01 ; Retrieved 37,743 generalization terms in 18,616 calls.
% 1.83/2.01 ; Retrieved 11,388 instance terms in 1,276 calls.
% 1.83/2.01 ; Retrieved 3,781 unifiable terms in 248 calls.
% 1.83/2.01 ;
% 1.83/2.01 ; The agenda of backward simplifiable rows to process has 245 entries:
% 1.83/2.01 ; 245 with value 0
% 1.83/2.01 ; The agenda of rows to process has 8 entries:
% 1.83/2.01 ; 8 with value 28
% 1.83/2.01 ; The agenda of input rows to give has 1 entry:
% 1.83/2.01 ; 1 with value 15
% 1.83/2.01 ; The agenda of rows to give has 60 entries:
% 1.83/2.01 ; 1 with value (4 18) 1 with value (4 59) 1 with value (4 141)
% 1.83/2.01 ; 1 with value (4 22) 1 with value (4 61) 1 with value (4 150)
% 1.83/2.01 ; 1 with value (4 24) 1 with value (4 66) 1 with value (4 153)
% 1.83/2.01 ; 1 with value (4 26) 1 with value (4 68) 1 with value (4 158)
% 1.83/2.01 ; 1 with value (4 27) 2 with value (4 70) 1 with value (4 159)
% 1.83/2.01 ; 1 with value (4 31) 1 with value (4 76) 1 with value (4 162)
% 1.83/2.01 ; 1 with value (4 33) 1 with value (4 85) 1 with value (4 168)
% 1.83/2.01 ; 2 with value (4 35) 1 with value (4 90) 1 with value (4 170)
% 1.83/2.01 ; 2 with value (4 37) 1 with value (4 91) 2 with value (4 172)
% 1.83/2.01 ; 1 with value (4 40) 1 with value (4 94) 1 with value (4 185)
% 1.83/2.01 ; 1 with value (4 44) 1 with value (4 95) 1 with value (4 189)
% 1.83/2.01 ; 1 with value (4 45) 1 with value (4 98) 1 with value (4 210)
% 1.83/2.01 ; 1 with value (4 46) 1 with value (4 100) 1 with value (4 217)
% 1.83/2.01 ; 2 with value (4 49) 1 with value (4 106) 1 with value (4 219)
% 1.83/2.01 ; 1 with value (4 50) 3 with value (4 110) 1 with value (4 220)
% 1.83/2.01 ; 1 with value (4 54) 1 with value (4 119) 1 with value (4 366)
% 1.83/2.01 ; 1 with value (4 55) 1 with value (4 124) 1 with value (4 941)
% 1.83/2.01 ; 2 with value (4 56)
% 1.83/2.01 Evaluation took:
% 1.83/2.01 1.495 seconds of real time
% 1.83/2.01 1.437296 seconds of user run time
% 1.83/2.01 0.058687 seconds of system run time
% 1.83/2.01 [Run times include 0.064 seconds GC run time.]
% 1.83/2.01 0 calls to %EVAL
% 1.83/2.01 0 page faults and
% 1.83/2.01 64,115,712 bytes consed.
% 1.83/2.01 :PROOF-FOUND
% 1.83/2.01 ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-14T01:27:40
% 1.83/2.01 :PROOF-FOUND
% 1.83/2.01 *
%------------------------------------------------------------------------------