TSTP Solution File: GRP685-11 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : GRP685-11 : TPTP v8.1.0. Released v8.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n023.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:20 EDT 2022
% Result : Unsatisfiable 0.60s 0.80s
% Output : Refutation 0.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 8
% Syntax : Number of clauses : 31 ( 31 unt; 0 nHn; 4 RR)
% Number of literals : 31 ( 30 equ; 3 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 : 56 ( 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(f06,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)],[f06,f04,theory(equality)]) ).
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,
rd(mult(x6,rd(x7,x8)),rd(x7,x8)) != rd(mult(x6,x8),x8),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goal) ).
cnf(11,plain,
mult(rd(x6,rd(x7,x8)),rd(x7,x8)) != mult(rd(x6,x8),x8),
inference('REWRITE',[status(thm)],[goal,f04,theory(equality)]) ).
cnf(12,plain,
mult(rd(X,X),X) = X,
inference('REWRITE',[status(thm)],[f02,f04,theory(equality)]) ).
cnf(14,plain,
ld(X,X) = rd(X,X),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[f04,12,theory(equality)]),f01,f03,9,theory(equality)]) ).
cnf(15,plain,
ld(X,mult(X,ld(Y,Y))) = mult(rd(ld(X,X),Y),Y),
inference('REWRITE',[status(thm)],[9,14,theory(equality)]) ).
cnf(16,plain,
mult(ld(X,X),X) = X,
inference('REWRITE',[status(thm)],[12,14,theory(equality)]) ).
cnf(17,plain,
mult(rd(X,ld(X,Y)),ld(X,Y)) = rd(ld(X,mult(X,Y)),ld(X,Y)),
inference('PARAMODULATE',[status(thm)],[f04,f03,theory(equality)]) ).
cnf(19,plain,
ld(X,mult(X,mult(Y,Z))) = mult(ld(X,mult(X,Y)),Z),
inference('PARAMODULATE',[status(thm)],[f05,f01,theory(equality)]) ).
cnf(21,plain,
ld(ld(X,Y),mult(ld(X,Y),Z)) = mult(ld(X,mult(X,ld(Z,Z))),Z),
inference('PARAMODULATE',[status(thm)],[f05,16,theory(equality)]) ).
cnf(36,plain,
mult(rd(X,rd(Y,Z)),rd(Y,Z)) = mult(ld(X,X),mult(rd(X,Z),Z)),
inference('PARAMODULATE',[status(thm)],[7,16,theory(equality)]) ).
cnf(38,plain,
mult(ld(x6,x6),mult(rd(x6,x8),x8)) != mult(rd(x6,x8),x8),
inference('REWRITE',[status(thm)],[11,36,theory(equality)]) ).
cnf(48,plain,
ld(X,mult(X,ld(ld(X,X),ld(X,X)))) = ld(X,X),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[15,14,theory(equality)]),16,theory(equality)]) ).
cnf(55,plain,
ld(X,mult(X,Y)) = mult(ld(X,mult(X,ld(Y,Y))),Y),
inference('PARAMODULATE',[status(thm)],[19,16,theory(equality)]) ).
cnf(56,plain,
ld(ld(X,Y),mult(ld(X,Y),Z)) = ld(X,mult(X,Z)),
inference('REWRITE',[status(thm)],[21,55,theory(equality)]) ).
cnf(91,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)],[56,f03,theory(equality)]),56,theory(equality)]) ).
cnf(92,plain,
ld(ld(X,X),ld(X,X)) = ld(X,X),
inference('REWRITE',[status(thm)],[48,f01,f03,91,theory(equality)]) ).
cnf(366,plain,
mult(rd(X,ld(X,X)),ld(X,X)) = rd(X,ld(X,X)),
inference('PARAMODULATE',[status(thm)],[17,f01,theory(equality)]) ).
cnf(397,plain,
mult(rd(X,ld(Y,Y)),ld(Y,Y)) = mult(ld(X,X),mult(rd(X,Y),Y)),
inference('PARAMODULATE',[status(thm)],[36,14,theory(equality)]) ).
cnf(399,plain,
X = rd(X,ld(X,X)),
inference('REWRITE',[status(thm)],[366,16,14,397,theory(equality)]) ).
cnf(427,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)],[36,399,theory(equality)]),397,theory(equality)]) ).
cnf(580,plain,
mult(ld(X,X),mult(rd(X,Y),Y)) = mult(rd(X,Y),Y),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[397,92,theory(equality)]),427,397,theory(equality)]) ).
cnf(656,plain,
$false,
inference('REWRITE',[status(thm)],[38,580,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.11 % Problem : GRP685-11 : TPTP v8.1.0. Released v8.1.0.
% 0.04/0.12 % Command : run-snark %s %d
% 0.12/0.33 % Computer : n023.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 : Tue Jun 14 12:18:35 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.45 *
% 0.18/0.45 *
% 0.18/0.46 #<PACKAGE "SNARK-USER">
% 0.18/0.46 *
% 0.18/0.46 SNARK-TPTP-OPTIONS
% 0.18/0.46 *
% 0.18/0.46 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.18/0.46 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.18/0.46 (USE-FACTORING :POS)
% 0.18/0.46 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.18/0.46 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.18/0.46 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.18/0.46 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.18/0.46 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.18/0.46 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.18/0.46 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.18/0.46 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.18/0.46 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.18/0.46 (DECLARE-TPTP-SYMBOLS2))
% 0.18/0.46 *
% 0.18/0.46 "."
% 0.18/0.46 *
% 0.18/0.46 ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-14T12:18:36
% 0.18/0.46 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n023.cluster.edu at 2022-06-14T12:18:36
% 0.60/0.80
% 0.60/0.80
% 0.60/0.80 #||
% 0.60/0.80 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.60/0.80 % SZS output start Refutation
% See solution above
% 0.60/0.81 ||#
% 0.60/0.81
% 0.60/0.81 ; Summary of computation:
% 0.60/0.81 ; 2059 formulas have been input or derived (from 60 formulas).
% 0.60/0.81 ; 656 (32%) were retained. Of these,
% 0.60/0.81 ; 412 (63%) were simplified or subsumed later,
% 0.60/0.81 ; 244 (37%) are still being kept.
% 0.60/0.81 ;
% 0.60/0.81 ; Run time in seconds excluding printing time:
% 0.60/0.81 ; 0.002 1% Read assertion file (1 call)
% 0.60/0.81 ; 0.000 0% Assert (8 calls)
% 0.60/0.81 ; 0.074 22% Process new row (1,998 calls)
% 0.60/0.81 ; 0.003 1% Resolution (118 calls)
% 0.60/0.81 ; 0.039 11% Paramodulation (59 calls)
% 0.60/0.81 ; 0.106 31% Forward simplification (1,842 calls)
% 0.60/0.81 ; 0.045 13% Backward simplification (653 calls)
% 0.60/0.81 ; 0.043 13% Ordering (6,741 calls)
% 0.60/0.81 ; 0.000 0% Sortal reasoning (32 calls)
% 0.60/0.81 ; 0.000 0% Purity testing (1 call)
% 0.60/0.81 ; 0.028 8% Other
% 0.60/0.81 ; 0.340 Total
% 0.60/0.81 ; 0.351 Real time
% 0.60/0.81 ;
% 0.60/0.81 ; Term-hash-array has 2,195 terms in all.
% 0.60/0.81 ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 0.60/0.81 ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 0.60/0.81 ; Path-index has 952 entries (1,094 at peak, 2,513 added, 1,561 deleted).
% 0.60/0.81 ; Path-index has 6,167 nodes (6,620 at peak, 8,760 added, 2,593 deleted).
% 0.60/0.81 ; Trie-index has 952 entries (1,094 at peak, 2,513 added, 1,561 deleted).
% 0.60/0.81 ; Trie-index has 6,812 nodes (8,437 at peak, 18,839 added, 12,027 deleted).
% 0.60/0.81 ; Retrieved 20,775 generalization terms in 22,001 calls.
% 0.60/0.81 ; Retrieved 1,894 instance terms in 805 calls.
% 0.60/0.81 ; Retrieved 4,736 unifiable terms in 402 calls.
% 0.60/0.81 ;
% 0.60/0.81 ; The agenda of rows to process has 42 entries:
% 0.60/0.81 ; 1 with value 33 2 with value 40 3 with value 49
% 0.60/0.81 ; 1 with value 34 3 with value 41 2 with value 50
% 0.60/0.81 ; 3 with value 35 1 with value 42 2 with value 52
% 0.60/0.81 ; 2 with value 36 5 with value 44 1 with value 54
% 0.60/0.81 ; 1 with value 37 4 with value 45 1 with value 59
% 0.60/0.81 ; 1 with value 38 2 with value 46 2 with value 60
% 0.60/0.81 ; 3 with value 39 1 with value 47 1 with value 62
% 0.60/0.81 ; The agenda of rows to give has 209 entries:
% 0.60/0.81 ; 1 with value (4 17) 13 with value (4 34) 3 with value (4 46)
% 0.60/0.81 ; 1 with value (4 20) 10 with value (4 35) 3 with value (4 47)
% 0.60/0.81 ; 2 with value (4 21) 10 with value (4 36) 1 with value (4 48)
% 0.60/0.81 ; 1 with value (4 22) 9 with value (4 37) 1 with value (4 49)
% 0.60/0.81 ; 2 with value (4 25) 8 with value (4 38) 1 with value (4 52)
% 0.60/0.81 ; 6 with value (4 26) 4 with value (4 39) 1 with value (4 53)
% 0.60/0.81 ; 8 with value (4 27) 4 with value (4 40) 3 with value (4 54)
% 0.60/0.81 ; 16 with value (4 28) 11 with value (4 41) 1 with value (4 55)
% 0.60/0.81 ; 12 with value (4 29) 7 with value (4 42) 1 with value (4 65)
% 0.60/0.81 ; 12 with value (4 30) 9 with value (4 43) 1 with value (4 67)
% 0.60/0.81 ; 15 with value (4 31) 2 with value (4 44) 1 with value (4 76)
% 0.60/0.81 ; 14 with value (4 32) 1 with value (4 45) 1 with value (4 99)
% 0.60/0.81 ; 13 with value (4 33)
% 0.60/0.81 Evaluation took:
% 0.60/0.81 0.352 seconds of real time
% 0.60/0.81 0.328683 seconds of user run time
% 0.60/0.81 0.023157 seconds of system run time
% 0.60/0.81 [Run times include 0.015 seconds GC run time.]
% 0.60/0.81 0 calls to %EVAL
% 0.60/0.81 0 page faults and
% 0.60/0.81 25,346,488 bytes consed.
% 0.60/0.81 :PROOF-FOUND
% 0.60/0.81 ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-14T12:18:36
% 0.60/0.81 :PROOF-FOUND
% 0.60/0.81 *
%------------------------------------------------------------------------------