TSTP Solution File: GRP680-1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : GRP680-1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n016.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:17 EDT 2022
% Result : Unsatisfiable 0.78s 1.00s
% Output : Refutation 0.78s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 8
% Syntax : Number of clauses : 29 ( 29 unt; 0 nHn; 4 RR)
% Number of literals : 29 ( 28 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 40 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c01,axiom,
mult(X,ld(X,Y)) = Y,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c01) ).
cnf(c02,axiom,
ld(X,mult(X,Y)) = Y,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c02) ).
cnf(c03,axiom,
mult(rd(X,Y),Y) = X,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c03) ).
cnf(c05,axiom,
mult(X,unit) = X,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c05) ).
cnf(c07,axiom,
mult(X,mult(Y,mult(X,Z))) = mult(mult(X,mult(Y,X)),Z),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c07) ).
cnf(c08,axiom,
mult(i(X),mult(X,Y)) = Y,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c08) ).
cnf(c09,axiom,
mult(op_c,X) = mult(X,op_c),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c09) ).
cnf(goals,negated_conjecture,
mult(i(op_c),a) != mult(a,i(op_c)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
cnf(13,plain,
ld(X,X) = unit,
inference('PARAMODULATE',[status(thm)],[c02,c05,theory(equality)]) ).
cnf(17,plain,
ld(rd(X,Y),X) = Y,
inference('PARAMODULATE',[status(thm)],[c02,c03,theory(equality)]) ).
cnf(26,plain,
ld(i(X),Y) = mult(X,Y),
inference('PARAMODULATE',[status(thm)],[c02,c08,theory(equality)]) ).
cnf(27,plain,
ld(i(X),ld(X,Y)) = Y,
inference('REWRITE',[status(thm)],[c01,26,theory(equality)]) ).
cnf(33,plain,
ld(i(X),ld(i(Y),ld(i(X),Z))) = ld(i(ld(i(X),ld(i(Y),X))),Z),
inference('REWRITE',[status(thm)],[c07,26,theory(equality)]) ).
cnf(36,plain,
ld(X,ld(i(X),Y)) = Y,
inference('REWRITE',[status(thm)],[c02,26,theory(equality)]) ).
cnf(38,plain,
ld(i(X),unit) = X,
inference('REWRITE',[status(thm)],[c05,26,theory(equality)]) ).
cnf(40,plain,
ld(i(op_c),X) = ld(i(X),op_c),
inference('REWRITE',[status(thm)],[c09,26,theory(equality)]) ).
cnf(43,plain,
ld(i(i(op_c)),a) != ld(i(a),i(op_c)),
inference('REWRITE',[status(thm)],[goals,26,theory(equality)]) ).
cnf(44,plain,
ld(i(i(X)),Y) = ld(X,Y),
inference('PARAMODULATE',[status(thm)],[27,27,theory(equality)]) ).
cnf(45,plain,
ld(op_c,a) != ld(i(a),i(op_c)),
inference('REWRITE',[status(thm)],[43,44,theory(equality)]) ).
cnf(67,plain,
ld(X,unit) = i(X),
inference('PARAMODULATE',[status(thm)],[36,13,theory(equality)]) ).
cnf(68,plain,
i(i(X)) = X,
inference('REWRITE',[status(thm)],[38,67,theory(equality)]) ).
cnf(70,plain,
ld(i(X),Y) = ld(i(ld(i(X),ld(i(Y),X))),i(X)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[33,13,theory(equality)]),68,67,theory(equality)]) ).
cnf(72,plain,
ld(i(op_c),i(X)) = ld(X,op_c),
inference('PARAMODULATE',[status(thm)],[40,68,theory(equality)]) ).
cnf(570,plain,
ld(ld(i(X),ld(i(Y),X)),ld(i(X),Y)) = i(X),
inference('PARAMODULATE',[status(thm)],[36,70,theory(equality)]) ).
cnf(585,plain,
ld(ld(i(op_c),ld(X,op_c)),ld(X,op_c)) = i(op_c),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[570,72,theory(equality)]),68,theory(equality)]) ).
cnf(646,plain,
ld(ld(i(op_c),X),X) = i(op_c),
inference('PARAMODULATE',[status(thm)],[585,17,theory(equality)]) ).
cnf(647,plain,
ld(X,ld(op_c,X)) = i(op_c),
inference('PARAMODULATE',[status(thm)],[646,27,theory(equality)]) ).
cnf(671,plain,
ld(i(X),i(op_c)) = ld(op_c,X),
inference('PARAMODULATE',[status(thm)],[27,647,theory(equality)]) ).
cnf(672,plain,
$false,
inference('REWRITE',[status(thm)],[45,671,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12 % Problem : GRP680-1 : TPTP v8.1.0. Released v4.0.0.
% 0.08/0.13 % Command : run-snark %s %d
% 0.14/0.34 % Computer : n016.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Tue Jun 14 07:36:15 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.21/0.46 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.47 *
% 0.21/0.47 *
% 0.21/0.48 #<PACKAGE "SNARK-USER">
% 0.21/0.48 *
% 0.21/0.48 SNARK-TPTP-OPTIONS
% 0.21/0.48 *
% 0.21/0.48 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.21/0.48 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.21/0.48 (USE-FACTORING :POS)
% 0.21/0.48 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.21/0.48 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.21/0.48 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.21/0.48 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.21/0.48 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.21/0.48 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.21/0.48 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.21/0.48 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.21/0.48 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.21/0.48 (DECLARE-TPTP-SYMBOLS2))
% 0.21/0.48 *
% 0.21/0.48 "."
% 0.21/0.48 *
% 0.21/0.48 ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-14T07:36:16
% 0.21/0.48 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n016.cluster.edu at 2022-06-14T07:36:16
% 0.21/0.49
% 0.21/0.49 ; Recognized right identity assertion (= (|mult| ?X |unit|) ?X).
% 0.78/1.00 ; Recognized left identity assertion (= (|mult| |unit| ?X) ?X).
% 0.78/1.00
% 0.78/1.00 #||
% 0.78/1.00 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.78/1.00 % SZS output start Refutation
% See solution above
% 0.78/1.00 ||#
% 0.78/1.00
% 0.78/1.00 ; Summary of computation:
% 0.78/1.00 ; 4419 formulas have been input or derived (from 130 formulas).
% 0.78/1.00 ; 672 (15%) were retained. Of these,
% 0.78/1.00 ; 94 (14%) were simplified or subsumed later,
% 0.78/1.00 ; 578 (86%) are still being kept.
% 0.78/1.00 ;
% 0.78/1.00 ; Run time in seconds excluding printing time:
% 0.78/1.00 ; 0.002 0% Read assertion file (1 call)
% 0.78/1.00 ; 0.000 0% Assert (10 calls)
% 0.78/1.00 ; 0.067 13% Process new row (4,244 calls)
% 0.78/1.00 ; 0.006 1% Resolution (258 calls)
% 0.78/1.00 ; 0.065 13% Paramodulation (129 calls)
% 0.78/1.00 ; 0.194 38% Forward simplification (4,145 calls)
% 0.78/1.00 ; 0.021 4% Backward simplification (672 calls)
% 0.78/1.00 ; 0.112 22% Ordering (27,630 calls)
% 0.78/1.00 ; 0.000 0% Sortal reasoning (32 calls)
% 0.78/1.00 ; 0.000 0% Purity testing (1 call)
% 0.78/1.00 ; 0.050 10% Other
% 0.78/1.00 ; 0.517 Total
% 0.78/1.00 ; 0.519 Real time
% 0.78/1.00 ;
% 0.78/1.00 ; Term-hash-array has 1,619 terms in all.
% 0.78/1.00 ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 0.78/1.00 ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 0.78/1.00 ; Path-index has 1,405 entries (1,411 at peak, 1,660 added, 255 deleted).
% 0.78/1.00 ; Path-index has 1,924 nodes (1,929 at peak, 2,166 added, 242 deleted).
% 0.78/1.00 ; Trie-index has 1,405 entries (1,411 at peak, 1,660 added, 255 deleted).
% 0.78/1.00 ; Trie-index has 10,924 nodes (10,968 at peak, 12,058 added, 1,134 deleted).
% 0.78/1.00 ; Retrieved 63,444 generalization terms in 43,727 calls.
% 0.78/1.00 ; Retrieved 1,600 instance terms in 819 calls.
% 0.78/1.00 ; Retrieved 7,410 unifiable terms in 970 calls.
% 0.78/1.00 ;
% 0.78/1.00 ; The agenda of rows to process has 73 entries:
% 0.78/1.00 ; 2 with value 19 10 with value 25 2 with value 30
% 0.78/1.00 ; 5 with value 20 14 with value 26 2 with value 32
% 0.78/1.00 ; 3 with value 21 6 with value 27 1 with value 33
% 0.78/1.00 ; 2 with value 22 6 with value 28 5 with value 34
% 0.78/1.00 ; 4 with value 24 5 with value 29 6 with value 35
% 0.78/1.00 ; The agenda of rows to give has 468 entries:
% 0.78/1.00 ; 2 with value (4 18) 38 with value (4 28) 12 with value (4 38)
% 0.78/1.00 ; 3 with value (4 19) 30 with value (4 29) 1 with value (4 39)
% 0.78/1.00 ; 1 with value (4 20) 12 with value (4 30) 7 with value (4 40)
% 0.78/1.00 ; 1 with value (4 21) 26 with value (4 31) 5 with value (4 41)
% 0.78/1.00 ; 3 with value (4 22) 38 with value (4 32) 4 with value (4 42)
% 0.78/1.00 ; 9 with value (4 23) 47 with value (4 33) 1 with value (4 43)
% 0.78/1.00 ; 18 with value (4 24) 39 with value (4 34) 2 with value (4 44)
% 0.78/1.00 ; 18 with value (4 25) 27 with value (4 35) 1 with value (4 54)
% 0.78/1.00 ; 21 with value (4 26) 46 with value (4 36) 1 with value (4 55)
% 0.78/1.00 ; 22 with value (4 27) 33 with value (4 37)
% 0.78/1.00 Evaluation took:
% 0.78/1.00 0.52 seconds of real time
% 0.78/1.00 0.456155 seconds of user run time
% 0.78/1.00 0.063745 seconds of system run time
% 0.78/1.00 [Run times include 0.012 seconds GC run time.]
% 0.78/1.00 0 calls to %EVAL
% 0.78/1.00 0 page faults and
% 0.78/1.00 30,609,008 bytes consed.
% 0.78/1.00 :PROOF-FOUND
% 0.78/1.00 ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-14T07:36:16
% 0.78/1.00 :PROOF-FOUND
% 0.78/1.00 *
%------------------------------------------------------------------------------