TSTP Solution File: RNG128-1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : RNG128-1 : TPTP v8.1.0. Released v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n020.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 : Mon Jul 18 20:40:52 EDT 2022
% Result : Unsatisfiable 0.44s 0.61s
% Output : Refutation 0.44s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 5
% Syntax : Number of clauses : 29 ( 29 unt; 0 nHn; 6 RR)
% Number of literals : 29 ( 28 equ; 1 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 33 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(sos_003,axiom,
mult(X,add(Y,Z)) = add(mult(X,Y),mult(X,Z)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_003) ).
cnf(sos_004,axiom,
add(zero,X) = X,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_004) ).
cnf(sos_005,axiom,
mult(X,unit) = X,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_005) ).
cnf(sos_006,axiom,
add(unit,add(X,mult(X,X))) = X,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_006) ).
cnf(5,plain,
add(unit,add(X,add(mult(X,X),Y))) = add(X,Y),
inference('EMBED',[status(thm)],[sos_006]) ).
cnf(goals,negated_conjecture,
add(x0,x1) != mult(x0,x1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
cnf(7,plain,
add(unit,add(unit,unit)) = unit,
inference('PARAMODULATE',[status(thm)],[sos_006,sos_005,theory(equality)]) ).
cnf(9,plain,
zero = add(unit,mult(zero,zero)),
inference('PARAMODULATE',[status(thm)],[sos_004,sos_006,theory(equality)]) ).
cnf(10,plain,
add(unit,add(mult(zero,zero),X)) = add(zero,X),
inference('EMBED',[status(thm)],[9]) ).
cnf(13,plain,
add(mult(X,X),X) = add(X,mult(mult(X,X),mult(X,X))),
inference('PARAMODULATE',[status(thm)],[5,5,theory(equality)]) ).
cnf(17,plain,
add(mult(X,X),add(mult(X,mult(X,X)),add(mult(X,mult(X,X)),add(mult(X,X),X)))) = add(mult(X,X),X),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[sos_006,5,theory(equality)]),13,sos_003,theory(equality)]) ).
cnf(19,plain,
add(X,add(Y,mult(Y,Y))) = add(X,add(mult(X,X),add(mult(X,mult(Y,Y)),add(mult(X,mult(Y,Y)),add(mult(Y,Y),Y))))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[5,5,theory(equality)]),13,sos_003,theory(equality)]) ).
cnf(21,plain,
add(mult(X,Y),add(mult(X,Y),add(X,add(mult(Y,Y),Y)))) = add(X,add(Y,mult(Y,Y))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[sos_006,5,theory(equality)]),17,13,19,sos_003,theory(equality)]) ).
cnf(31,plain,
mult(X,Y) = add(mult(X,Y),mult(X,zero)),
inference('PARAMODULATE',[status(thm)],[sos_003,sos_004,theory(equality)]) ).
cnf(39,plain,
X = add(X,add(X,X)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[sos_003,7,theory(equality)]),sos_003,sos_005,theory(equality)]) ).
cnf(45,plain,
mult(X,zero) = add(X,mult(X,mult(zero,zero))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[sos_003,9,theory(equality)]),sos_005,theory(equality)]) ).
cnf(47,plain,
add(mult(X,X),X) = add(X,mult(zero,zero)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[5,10,theory(equality)]),sos_004,theory(equality)]) ).
cnf(49,plain,
zero = add(unit,unit),
inference('REWRITE',[status(thm)],[9,sos_005,47,theory(equality)]) ).
cnf(51,plain,
mult(X,zero) = add(X,X),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[sos_003,49,theory(equality)]),sos_005,theory(equality)]) ).
cnf(52,plain,
mult(X,Y) = add(mult(X,Y),add(X,X)),
inference('REWRITE',[status(thm)],[31,51,theory(equality)]) ).
cnf(54,plain,
add(X,X) = X,
inference('REWRITE',[status(thm)],[45,39,sos_004,51,theory(equality)]) ).
cnf(56,plain,
mult(X,Y) = add(mult(X,Y),X),
inference('REWRITE',[status(thm)],[52,54,theory(equality)]) ).
cnf(66,plain,
add(unit,mult(X,X)) = X,
inference('REWRITE',[status(thm)],[sos_006,56,theory(equality)]) ).
cnf(75,plain,
add(mult(X,X),mult(X,Y)) = add(mult(X,X),Y),
inference('REWRITE',[status(thm)],[21,56,54,theory(equality)]) ).
cnf(77,plain,
zero = unit,
inference('REWRITE',[status(thm)],[49,54,theory(equality)]) ).
cnf(78,plain,
add(unit,X) = X,
inference('REWRITE',[status(thm)],[sos_004,77,theory(equality)]) ).
cnf(79,plain,
mult(X,X) = X,
inference('REWRITE',[status(thm)],[66,78,theory(equality)]) ).
cnf(80,plain,
mult(X,Y) = add(X,Y),
inference('REWRITE',[status(thm)],[75,56,79,theory(equality)]) ).
cnf(81,plain,
$false,
inference('REWRITE',[status(thm)],[goals,80,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : RNG128-1 : TPTP v8.1.0. Released v5.4.0.
% 0.10/0.13 % Command : run-snark %s %d
% 0.12/0.34 % Computer : n020.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Mon May 30 10:06:54 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.45 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.46 *
% 0.19/0.46 *
% 0.19/0.47 #<PACKAGE "SNARK-USER">
% 0.19/0.47 *
% 0.19/0.47 SNARK-TPTP-OPTIONS
% 0.19/0.47 *
% 0.19/0.47 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.19/0.47 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.19/0.47 (USE-FACTORING :POS)
% 0.19/0.47 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.19/0.47 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.19/0.47 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.19/0.47 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.19/0.47 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.19/0.47 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.19/0.47 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.19/0.47 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.19/0.47 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.19/0.47 (DECLARE-TPTP-SYMBOLS2))
% 0.19/0.47 *
% 0.19/0.47 "."
% 0.19/0.47 *
% 0.19/0.47 ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-05-30T10:06:54
% 0.19/0.47 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n020.cluster.edu at 2022-05-30T10:06:54
% 0.19/0.48
% 0.19/0.48 ; Recognized associativity assertion (= (|add| ?X (|add| ?Y ?Z)) (|add| (|add| ?X ?Y) ?Z)).
% 0.19/0.48 ; Recognized commutativity assertion (= (|add| ?X ?Y) (|add| ?Y ?X)).
% 0.19/0.48 ; Recognized commutativity assertion (= (|mult| ?X ?Y) (|mult| ?Y ?X)).
% 0.19/0.48 ; Recognized left identity assertion (= (|add| |zero| ?X) ?X).
% 0.19/0.48 ; Recognized right identity assertion (= (|mult| ?X |unit|) ?X).
% 0.19/0.48 ; Declaring add to be commutative.
% 0.19/0.48 ; Declaring add to be associative-commutative.
% 0.44/0.61 ; Declaring mult to be commutative.
% 0.44/0.61
% 0.44/0.61 #||
% 0.44/0.61 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.44/0.61 % SZS output start Refutation
% See solution above
% 0.44/0.61 ||#
% 0.44/0.61
% 0.44/0.61 ; Summary of computation:
% 0.44/0.61 ; 193 formulas have been input or derived (from 11 formulas).
% 0.44/0.61 ; 81 (42%) were retained. Of these,
% 0.44/0.61 ; 75 (93%) were simplified or subsumed later,
% 0.44/0.61 ; 6 ( 7%) are still being kept.
% 0.44/0.61 ;
% 0.44/0.61 ; Run time in seconds excluding printing time:
% 0.44/0.61 ; 0.001 1% Read assertion file (1 call)
% 0.44/0.61 ; 0.001 1% Assert (8 calls)
% 0.44/0.61 ; 0.010 7% Process new row (185 calls)
% 0.44/0.61 ; 0.000 0% Resolution (20 calls)
% 0.44/0.61 ; 0.003 2% Paramodulation (10 calls)
% 0.44/0.61 ; 0.002 1% Embedding (40 calls)
% 0.44/0.61 ; 0.078 57% Forward simplification (137 calls)
% 0.44/0.61 ; 0.016 12% Backward simplification (46 calls)
% 0.44/0.61 ; 0.000 0% Ordering (329 calls)
% 0.44/0.61 ; 0.002 1% Ordering ac (224 calls)
% 0.44/0.61 ; 0.000 0% Sortal reasoning (32 calls)
% 0.44/0.61 ; 0.000 0% Purity testing (1 call)
% 0.44/0.61 ; 0.024 18% Other
% 0.44/0.61 ; 0.137 Total
% 0.44/0.61 ; 0.139 Real time
% 0.44/0.61 ;
% 0.44/0.61 ; Term-hash-array has 197 terms in all.
% 0.44/0.61 ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 0.44/0.61 ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 0.44/0.61 ; Path-index has 14 entries (107 at peak, 243 added, 229 deleted).
% 0.44/0.61 ; Path-index has 26 nodes (51 at peak, 64 added, 38 deleted).
% 0.44/0.61 ; Trie-index has 14 entries (107 at peak, 243 added, 229 deleted).
% 0.44/0.61 ; Trie-index has 19 nodes (49 at peak, 79 added, 60 deleted).
% 0.44/0.61 ; Retrieved 7,355 generalization terms in 2,244 calls.
% 0.44/0.61 ; Retrieved 419 instance terms in 49 calls.
% 0.44/0.61 ; Retrieved 227 unifiable terms in 53 calls.
% 0.44/0.61 ;
% 0.44/0.61 ; The agenda of backward simplifiable rows to process has 5 entries:
% 0.44/0.61 ; 5 with value 0
% 0.44/0.61 ; The agenda of input rows to give has 1 entry:
% 0.44/0.61 ; 1 with value 7
% 0.44/0.61 ; The agenda of rows to give has 4 entries:
% 0.44/0.61 ; 1 with value (4 5) 2 with value (4 9) 1 with value (4 10)
% 0.44/0.61 Evaluation took:
% 0.44/0.61 0.14 seconds of real time
% 0.44/0.61 0.135134 seconds of user run time
% 0.44/0.61 0.004002 seconds of system run time
% 0.44/0.61 0 calls to %EVAL
% 0.44/0.61 0 page faults and
% 0.44/0.61 6,776,824 bytes consed.
% 0.44/0.61 :PROOF-FOUND
% 0.44/0.61 ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-05-30T10:06:54
% 0.44/0.61 :PROOF-FOUND
% 0.44/0.61 *
%------------------------------------------------------------------------------