TSTP Solution File: NUM420-1.000 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : NUM420-1.000 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n008.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 14:10:20 EDT 2022
% Result : Unsatisfiable 1.36s 1.56s
% Output : Refutation 1.36s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 13
% Syntax : Number of clauses : 27 ( 15 unt; 3 nHn; 18 RR)
% Number of literals : 44 ( 25 equ; 21 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-2 aty)
% Number of variables : 28 ( 10 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(axiom_2,axiom,
plus(X,n0) = X,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_2) ).
cnf(axiom_9,axiom,
( X != plus(X,Y)
| Y = n0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_9) ).
cnf(axiom_16,axiom,
plus(X,n1) != n0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_16) ).
cnf(axiom_17,axiom,
times(X,n1) = X,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_17) ).
cnf(axiom_21,axiom,
times(X,plus(Z,Y)) = plus(times(X,Y),times(X,Z)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_21) ).
cnf(axiom_27,axiom,
( n1 != times(X,Y)
| X = n1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_27) ).
cnf(axiom_30,axiom,
less(n0,plus(X,n1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_30) ).
cnf(clause_18,negated_conjecture,
( ~ less(n0,p__0)
| p__0 = plus(s_7(p__0),n1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_18) ).
cnf(clause_24,negated_conjecture,
( ~ less(n0,X)
| ~ less(n0,p__0)
| ~ less(X,p__0)
| plus(X,times(Y,p__0)) != plus(n0,times(Z,p__0)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_24) ).
cnf(24,plain,
( ~ less(n0,X)
| ~ less(n0,p__0)
| ~ less(X,p__0)
| plus(X,times(Y,p__0)) != times(Z,p__0) ),
inference('REWRITE',[status(thm)],[clause_24,axiom_2,theory(equality)]) ).
cnf(clause_34,negated_conjecture,
( ~ less(plus(n0,n1),p__0)
| less(n0,p__0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_34) ).
cnf(27,plain,
( ~ less(n1,p__0)
| less(n0,p__0) ),
inference('REWRITE',[status(thm)],[clause_34,axiom_2,theory(equality)]) ).
cnf(clause_44,negated_conjecture,
( X != p__0
| less(n1,X) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_44) ).
cnf(clause_48,negated_conjecture,
( X = n1
| times(s_1(X),s_4(X)) = X ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_48) ).
cnf(clause_53,negated_conjecture,
( X = n1
| s_1(X) = p__0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_53) ).
cnf(34,plain,
less(n0,n1),
inference('PARAMODULATE',[status(thm)],[axiom_30,axiom_2,theory(equality)]) ).
cnf(36,plain,
less(n1,p__0),
inference('HYPERRESOLVE',[status(thm)],[clause_44,theory(equality)]) ).
cnf(37,plain,
less(n0,p__0),
inference('REWRITE',[status(thm)],[27,36]) ).
cnf(40,plain,
p__0 = plus(s_7(p__0),n1),
inference('REWRITE',[status(thm)],[clause_18,37]) ).
cnf(41,plain,
plus(s_7(p__0),plus(n1,X)) = plus(p__0,X),
inference('EMBED',[status(thm)],[40]) ).
cnf(44,plain,
( ~ less(n0,X)
| ~ less(X,p__0)
| plus(X,times(Y,p__0)) != times(Z,p__0) ),
inference('REWRITE',[status(thm)],[24,37]) ).
cnf(47,plain,
p__0 != n0,
inference('PARAMODULATE',[status(thm)],[axiom_16,40,theory(equality)]) ).
cnf(61,plain,
X != plus(p__0,X),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[axiom_9,41,theory(equality)]),47,40,theory(equality)]) ).
cnf(81,plain,
( X = n1
| times(p__0,s_4(X)) = X ),
inference('PARAMODULATE',[status(thm)],[clause_48,clause_53,theory(equality)]) ).
cnf(206,plain,
n1 != plus(X,times(p__0,X)),
inference('REWRITE',[status(thm)],[inference('UR-RESOLVE',[status(thm)],[axiom_27,61]),axiom_17,axiom_21,theory(equality)]) ).
cnf(516,plain,
plus(n1,times(p__0,X)) = n1,
inference('HYPERRESOLVE',[status(thm)],[44,81,34,36]) ).
cnf(540,plain,
$false,
inference('HYPERRESOLVE',[status(thm)],[206,516]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : NUM420-1.000 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13 % Command : run-snark %s %d
% 0.14/0.35 % Computer : n008.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Thu Jul 7 15:12:38 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.20/0.47 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.48 *
% 0.20/0.48 *
% 0.20/0.48 #<PACKAGE "SNARK-USER">
% 0.20/0.48 *
% 0.20/0.48 SNARK-TPTP-OPTIONS
% 0.20/0.48 *
% 0.20/0.48 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.20/0.48 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.20/0.48 (USE-FACTORING :POS)
% 0.20/0.48 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.20/0.48 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.20/0.48 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.20/0.48 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.20/0.48 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.20/0.48 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.20/0.48 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.20/0.48 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.20/0.48 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.20/0.48 (DECLARE-TPTP-SYMBOLS2))
% 0.20/0.48 *
% 0.20/0.48 "."
% 0.20/0.48 *
% 0.20/0.48 ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-07-07T15:12:38
% 0.20/0.48 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n008.cluster.edu at 2022-07-07T15:12:38
% 0.20/0.51
% 0.20/0.51 ; Recognized right identity assertion (= (|plus| ?X |n0|) ?X).
% 0.20/0.51 ; Recognized associativity assertion (= (|plus| (|plus| ?X ?Y) ?Z) (|plus| ?X (|plus| ?Y ?Z))).
% 0.20/0.51 ; Recognized associativity assertion (= (|plus| ?X (|plus| ?Y ?Z)) (|plus| (|plus| ?X ?Y) ?Z)).
% 0.20/0.51 ; Recognized commutativity assertion (= (|plus| ?X ?Y) (|plus| ?Y ?X)).
% 0.20/0.51 ; Recognized left identity assertion (= (|plus| |n0| ?X) ?X).
% 0.20/0.51 ; Recognized commutativity assertion (= (|times| ?X ?Y) (|times| ?Y ?X)).
% 0.20/0.51 ; Recognized right identity assertion (= (|times| ?X |n1|) ?X).
% 0.20/0.51 ; Recognized associativity assertion (= (|times| ?X (|times| ?Y ?Z)) (|times| (|times| ?X ?Y) ?Z)).
% 0.20/0.51 ; Recognized associativity assertion (= (|times| (|times| ?X ?Y) ?Z) (|times| ?X (|times| ?Y ?Z))).
% 0.20/0.51 ; Recognized left identity assertion (= (|times| |n1| ?X) ?X).
% 0.20/0.51 ; Declaring plus to be commutative.
% 0.20/0.51 ; Declaring plus to be associative-commutative.
% 0.20/0.51 ; Declaring times to be commutative.
% 0.20/0.51 WARNING:
% 0.20/0.51 |element| is a 2-ary relation that occurs only negatively; disabling rows that contain it.
% 1.36/1.56 ; Declaring times to be associative-commutative.
% 1.36/1.56
% 1.36/1.56 #||
% 1.36/1.56 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.36/1.56 % SZS output start Refutation
% See solution above
% 1.36/1.57 ||#
% 1.36/1.57
% 1.36/1.57 ; Summary of computation:
% 1.36/1.57 ; 4562 formulas have been input or derived (from 115 formulas).
% 1.36/1.57 ; 540 (12%) were retained. Of these,
% 1.36/1.57 ; 71 (13%) were simplified or subsumed later,
% 1.36/1.57 ; 469 (87%) are still being kept.
% 1.36/1.57 ;
% 1.36/1.57 ; Run time in seconds excluding printing time:
% 1.36/1.57 ; 0.015 1% Read assertion file (1 call)
% 1.36/1.57 ; 0.003 0% Assert (91 calls)
% 1.36/1.57 ; 0.051 5% Process new row (3,873 calls)
% 1.36/1.57 ; 0.354 33% Resolution (228 calls)
% 1.36/1.57 ; 0.025 2% Paramodulation (114 calls)
% 1.36/1.57 ; 0.000 0% Factoring (7 calls)
% 1.36/1.57 ; 0.000 0% Embedding (30 calls)
% 1.36/1.57 ; 0.152 14% Condensing (1,002 calls)
% 1.36/1.57 ; 0.049 5% Forward subsumption (1,002 calls)
% 1.36/1.57 ; 0.003 0% Backward subsumption (243 calls)
% 1.36/1.57 ; 0.088 8% Clause clause subsumption (1,371 calls)
% 1.36/1.57 ; 0.281 26% Forward simplification (3,842 calls)
% 1.36/1.57 ; 0.012 1% Backward simplification (508 calls)
% 1.36/1.57 ; 0.008 1% Ordering (4,017 calls)
% 1.36/1.57 ; 0.001 0% Ordering ac (463 calls)
% 1.36/1.57 ; 0.000 0% Sortal reasoning (32 calls)
% 1.36/1.57 ; 0.001 0% Purity testing (1 call)
% 1.36/1.57 ; 0.035 3% Other
% 1.36/1.57 ; 1.078 Total
% 1.36/1.57 ; 1.083 Real time
% 1.36/1.57 ;
% 1.36/1.57 ; Term-hash-array has 1,077 terms in all.
% 1.36/1.57 ; Feature-vector-row-index has 219 entries (219 at peak, 243 added, 24 deleted).
% 1.36/1.57 ; Feature-vector-row-index has 1,053 nodes (1,053 at peak, 1,261 added, 208 deleted).
% 1.36/1.57 ; Retrieved 2,430 possibly forward subsuming rows in 1,002 calls.
% 1.36/1.57 ; Retrieved 108 possibly backward subsumed rows in 243 calls.
% 1.36/1.57 ; Path-index has 990 entries (996 at peak, 1,107 added, 117 deleted).
% 1.36/1.57 ; Path-index has 582 nodes (601 at peak, 682 added, 100 deleted).
% 1.36/1.57 ; Trie-index has 990 entries (996 at peak, 1,107 added, 117 deleted).
% 1.36/1.57 ; Trie-index has 284 nodes (284 at peak, 371 added, 87 deleted).
% 1.36/1.57 ; Retrieved 210,356 generalization terms in 35,190 calls.
% 1.36/1.57 ; Retrieved 1,132 instance terms in 264 calls.
% 1.36/1.57 ; Retrieved 272,752 unifiable terms in 6,188 calls.
% 1.36/1.57 ;
% 1.36/1.57 ; The agenda of rows to process has 50 entries:
% 1.36/1.57 ; 4 with value 7 6 with value 14 1 with value 19
% 1.36/1.57 ; 1 with value 8 1 with value 15 3 with value 21
% 1.36/1.57 ; 5 with value 10 1 with value 16 2 with value 23
% 1.36/1.57 ; 2 with value 11 6 with value 17 5 with value 25
% 1.36/1.57 ; 9 with value 13 2 with value 18 2 with value 33
% 1.36/1.57 ; The agenda of rows to give has 359 entries:
% 1.36/1.57 ; 1 with value (4 12) 7 with value (4 26) 2 with value (4 43)
% 1.36/1.57 ; 1 with value (4 13) 13 with value (4 28) 4 with value (4 44)
% 1.36/1.57 ; 22 with value (4 14) 5 with value (4 29) 4 with value (4 45)
% 1.36/1.57 ; 26 with value (4 15) 8 with value (4 30) 2 with value (4 46)
% 1.36/1.57 ; 23 with value (4 16) 7 with value (4 31) 3 with value (4 47)
% 1.36/1.57 ; 24 with value (4 17) 6 with value (4 32) 2 with value (4 49)
% 1.36/1.57 ; 29 with value (4 18) 3 with value (4 33) 2 with value (4 57)
% 1.36/1.57 ; 22 with value (4 19) 2 with value (4 34) 2 with value (4 63)
% 1.36/1.57 ; 20 with value (4 20) 11 with value (4 35) 2 with value (4 65)
% 1.36/1.57 ; 15 with value (4 21) 2 with value (4 36) 1 with value (4 69)
% 1.36/1.57 ; 16 with value (4 22) 11 with value (4 37) 2 with value (4 75)
% 1.36/1.57 ; 19 with value (4 23) 4 with value (4 39) 2 with value (4 79)
% 1.36/1.57 ; 5 with value (4 24) 1 with value (4 41) 2 with value (4 83)
% 1.36/1.57 ; 22 with value (4 25) 2 with value (4 42) 2 with value (4 95)
% 1.36/1.57 Evaluation took:
% 1.36/1.57 1.083 seconds of real time
% 1.36/1.57 1.035835 seconds of user run time
% 1.36/1.57 0.047922 seconds of system run time
% 1.36/1.57 [Run times include 0.039 seconds GC run time.]
% 1.36/1.57 0 calls to %EVAL
% 1.36/1.57 0 page faults and
% 1.36/1.57 101,107,432 bytes consed.
% 1.36/1.57 :PROOF-FOUND
% 1.36/1.57 ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-07-07T15:12:39
% 1.36/1.57 :PROOF-FOUND
% 1.36/1.57 *
%------------------------------------------------------------------------------