TSTP Solution File: GRP683-10 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : GRP683-10 : TPTP v8.1.0. Released v8.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n006.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 : Unsatisfiable 0.48s 0.67s
% Output : Refutation 0.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 7
% Syntax : Number of clauses : 33 ( 33 unt; 0 nHn; 2 RR)
% Number of literals : 33 ( 32 equ; 1 neg)
% Maximal clause size : 1 ( 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; 3 con; 0-2 aty)
% Number of variables : 79 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(f01,axiom,
ld(X,mult(X,X)) = X,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f01) ).
cnf(f02,axiom,
rd(mult(X,X),X) = X,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f02) ).
cnf(f03,axiom,
mult(X,ld(X,Y)) = ld(X,mult(X,Y)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f03) ).
cnf(f04,axiom,
mult(rd(X,Y),Y) = rd(mult(X,Y),Y),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f04) ).
cnf(f05,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(f07,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)],[f07,f04,theory(equality)]) ).
cnf(goal,negated_conjecture,
mult(x3,ld(x4,mult(x4,x5))) != mult(x3,x5),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goal) ).
cnf(11,plain,
mult(rd(X,X),X) = X,
inference('REWRITE',[status(thm)],[f02,f04,theory(equality)]) ).
cnf(13,plain,
ld(X,X) = rd(X,X),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[f04,11,theory(equality)]),f01,f03,9,theory(equality)]) ).
cnf(15,plain,
mult(ld(X,X),X) = X,
inference('REWRITE',[status(thm)],[11,13,theory(equality)]) ).
cnf(18,plain,
ld(X,mult(X,mult(Y,Z))) = mult(ld(X,mult(X,Y)),Z),
inference('PARAMODULATE',[status(thm)],[f05,f01,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)],[f05,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)],[f05,f03,theory(equality)]) ).
cnf(52,plain,
ld(X,mult(X,mult(X,Y))) = mult(X,Y),
inference('PARAMODULATE',[status(thm)],[18,f01,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(80,plain,
ld(X,ld(X,mult(X,Y))) = ld(X,Y),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[f01,54,theory(equality)]),f03,theory(equality)]) ).
cnf(82,plain,
ld(X,mult(X,mult(ld(X,Y),Z))) = mult(ld(X,Y),Z),
inference('REWRITE',[status(thm)],[65,80,theory(equality)]) ).
cnf(87,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(88,plain,
mult(ld(X,Y),ld(X,mult(X,Z))) = mult(ld(X,Y),Z),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[f03,54,theory(equality)]),82,54,theory(equality)]) ).
cnf(93,plain,
ld(ld(X,Y),ld(X,mult(X,Z))) = ld(ld(X,Y),Z),
inference('PARAMODULATE',[status(thm)],[80,54,theory(equality)]) ).
cnf(94,plain,
ld(ld(X,mult(X,Y)),mult(Y,Z)) = ld(X,mult(X,Z)),
inference('REWRITE',[status(thm)],[87,93,theory(equality)]) ).
cnf(116,plain,
ld(X,ld(ld(X,mult(X,Y)),mult(Y,Z))) = ld(X,Z),
inference('PARAMODULATE',[status(thm)],[80,94,theory(equality)]) ).
cnf(120,plain,
ld(ld(X,mult(X,Y)),ld(Y,mult(Y,Z))) = ld(X,mult(X,ld(Y,Z))),
inference('PARAMODULATE',[status(thm)],[94,f03,theory(equality)]) ).
cnf(140,plain,
mult(X,ld(ld(X,mult(X,Y)),mult(Y,Z))) = mult(X,Z),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[f03,94,theory(equality)]),52,theory(equality)]) ).
cnf(143,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)],[94,88,theory(equality)]),52,120,theory(equality)]) ).
cnf(291,plain,
ld(X,Y) = ld(X,ld(Z,mult(Z,Y))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[116,88,theory(equality)]),116,143,120,theory(equality)]) ).
cnf(305,plain,
ld(ld(X,mult(X,Y)),Z) = ld(X,mult(X,ld(Y,Z))),
inference('REWRITE',[status(thm)],[120,291,theory(equality)]) ).
cnf(325,plain,
mult(X,ld(ld(X,mult(X,Y)),Z)) = mult(X,ld(Y,Z)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[f03,305,theory(equality)]),52,theory(equality)]) ).
cnf(326,plain,
mult(X,ld(Y,mult(Y,Z))) = mult(X,Z),
inference('REWRITE',[status(thm)],[140,325,theory(equality)]) ).
cnf(330,plain,
$false,
inference('REWRITE',[status(thm)],[goal,326,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : GRP683-10 : TPTP v8.1.0. Released v8.1.0.
% 0.13/0.14 % Command : run-snark %s %d
% 0.13/0.35 % Computer : n006.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 : Mon Jun 13 15:03:41 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.47 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.48 *
% 0.20/0.48 *
% 0.20/0.49 #<PACKAGE "SNARK-USER">
% 0.20/0.49 *
% 0.20/0.49 SNARK-TPTP-OPTIONS
% 0.20/0.49 *
% 0.20/0.49 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.20/0.49 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.20/0.49 (USE-FACTORING :POS)
% 0.20/0.49 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.20/0.49 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.20/0.49 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.20/0.49 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.20/0.49 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.20/0.49 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.20/0.49 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.20/0.49 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.20/0.49 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.20/0.49 (DECLARE-TPTP-SYMBOLS2))
% 0.20/0.49 *
% 0.20/0.49 "."
% 0.20/0.49 *
% 0.20/0.49 ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-13T15:03:42
% 0.20/0.49 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n006.cluster.edu at 2022-06-13T15:03:42
% 0.48/0.67
% 0.48/0.67
% 0.48/0.67 #||
% 0.48/0.67 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.48/0.67 % SZS output start Refutation
% See solution above
% 0.48/0.68 ||#
% 0.48/0.68
% 0.48/0.68 ; Summary of computation:
% 0.48/0.68 ; 980 formulas have been input or derived (from 41 formulas).
% 0.48/0.68 ; 330 (34%) were retained. Of these,
% 0.48/0.68 ; 188 (57%) were simplified or subsumed later,
% 0.48/0.68 ; 142 (43%) are still being kept.
% 0.48/0.68 ;
% 0.48/0.68 ; Run time in seconds excluding printing time:
% 0.48/0.68 ; 0.002 1% Read assertion file (1 call)
% 0.48/0.68 ; 0.001 1% Assert (8 calls)
% 0.48/0.68 ; 0.045 26% Process new row (947 calls)
% 0.48/0.68 ; 0.001 1% Resolution (80 calls)
% 0.48/0.68 ; 0.015 9% Paramodulation (40 calls)
% 0.48/0.68 ; 0.046 26% Forward simplification (900 calls)
% 0.48/0.68 ; 0.016 9% Backward simplification (328 calls)
% 0.48/0.68 ; 0.020 11% Ordering (2,920 calls)
% 0.48/0.68 ; 0.000 0% Sortal reasoning (32 calls)
% 0.48/0.68 ; 0.000 0% Purity testing (1 call)
% 0.48/0.68 ; 0.028 16% Other
% 0.48/0.68 ; 0.174 Total
% 0.48/0.68 ; 0.188 Real time
% 0.48/0.68 ;
% 0.48/0.68 ; Term-hash-array has 1,096 terms in all.
% 0.48/0.68 ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 0.48/0.68 ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 0.48/0.68 ; Path-index has 521 entries (670 at peak, 1,227 added, 706 deleted).
% 0.48/0.68 ; Path-index has 3,123 nodes (3,365 at peak, 4,216 added, 1,093 deleted).
% 0.48/0.68 ; Trie-index has 521 entries (670 at peak, 1,227 added, 706 deleted).
% 0.48/0.68 ; Trie-index has 3,767 nodes (5,317 at peak, 8,953 added, 5,186 deleted).
% 0.48/0.68 ; Retrieved 8,113 generalization terms in 9,636 calls.
% 0.48/0.68 ; Retrieved 966 instance terms in 392 calls.
% 0.48/0.68 ; Retrieved 2,440 unifiable terms in 269 calls.
% 0.48/0.68 ;
% 0.48/0.68 ; The agenda of rows to process has 26 entries:
% 0.48/0.68 ; 3 with value 28 9 with value 33 1 with value 49
% 0.48/0.68 ; 3 with value 29 2 with value 41 1 with value 59
% 0.48/0.68 ; 7 with value 32
% 0.48/0.68 ; The agenda of rows to give has 117 entries:
% 0.48/0.68 ; 1 with value (4 18) 6 with value (4 31) 1 with value (4 41)
% 0.48/0.68 ; 1 with value (4 22) 11 with value (4 32) 2 with value (4 42)
% 0.48/0.68 ; 1 with value (4 23) 6 with value (4 33) 1 with value (4 43)
% 0.48/0.68 ; 7 with value (4 24) 2 with value (4 34) 1 with value (4 46)
% 0.48/0.68 ; 7 with value (4 25) 2 with value (4 35) 1 with value (4 52)
% 0.48/0.68 ; 2 with value (4 26) 4 with value (4 36) 2 with value (4 53)
% 0.48/0.68 ; 5 with value (4 27) 7 with value (4 37) 2 with value (4 54)
% 0.48/0.68 ; 20 with value (4 28) 5 with value (4 38) 2 with value (4 65)
% 0.48/0.68 ; 9 with value (4 29) 2 with value (4 39) 1 with value (4 70)
% 0.48/0.68 ; 2 with value (4 30) 4 with value (4 40)
% 0.48/0.68 Evaluation took:
% 0.48/0.68 0.188 seconds of real time
% 0.48/0.68 0.171697 seconds of user run time
% 0.48/0.68 0.016724 seconds of system run time
% 0.48/0.68 [Run times include 0.011 seconds GC run time.]
% 0.48/0.68 0 calls to %EVAL
% 0.48/0.68 0 page faults and
% 0.48/0.68 13,761,440 bytes consed.
% 0.48/0.68 :PROOF-FOUND
% 0.48/0.68 ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-13T15:03:42
% 0.48/0.68 :PROOF-FOUND
% 0.48/0.68 *
%------------------------------------------------------------------------------