TSTP Solution File: HWV017-1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : HWV017-1 : TPTP v8.1.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n015.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 19:10:39 EDT 2022
% Result : Unsatisfiable 0.58s 0.74s
% Output : Refutation 0.58s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 21
% Syntax : Number of clauses : 42 ( 24 unt; 12 nHn; 36 RR)
% Number of literals : 69 ( 24 equ; 24 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 31 ( 7 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(axiom_1,axiom,
plus(X,n1) != n0,
file('/export/starexec/sandbox2/benchmark/Axioms/HWV003-0.ax',axiom_1) ).
cnf(axiom_2,axiom,
gt(plus(X,n1),n0),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV003-0.ax',axiom_2) ).
cnf(axiom_3,axiom,
( ~ gt(X,n0)
| gt(X,minus(X,n1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV003-0.ax',axiom_3) ).
cnf(axiom_4,axiom,
( minus(X,Y) != Z
| plus(Z,Y) = X
| def_10(Y,X) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV003-0.ax',axiom_4) ).
cnf(axiom_6,axiom,
( ~ def_10(X,Y)
| ~ gt(Y,X) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV003-0.ax',axiom_6) ).
cnf(axiom_9,axiom,
( gt(X,Y)
| ~ gt(plus(X,n1),plus(Y,n1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV003-0.ax',axiom_9) ).
cnf(axiom_13,axiom,
( ~ gt(X,Y)
| gt(X,Z)
| ~ gt(Y,Z) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV003-0.ax',axiom_13) ).
cnf(axiom_14,axiom,
( ~ gt(X,Y)
| plus(Y,n1) = X
| gt(X,plus(Y,n1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV003-0.ax',axiom_14) ).
cnf(axiom_15,axiom,
( X = n0
| gt(X,n0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV003-0.ax',axiom_15) ).
cnf(axiom_17,axiom,
~ gt(X,X),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV003-0.ax',axiom_17) ).
cnf(axiom_19,axiom,
plus(n0,X) = X,
file('/export/starexec/sandbox2/benchmark/Axioms/HWV003-0.ax',axiom_19) ).
cnf(axiom_21,axiom,
level(X) = int_level(X),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV003-0.ax',axiom_21) ).
cnf(axiom_23,axiom,
( int_level(X) = fifo_length
| ~ p_Full(X) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV003-0.ax',axiom_23) ).
cnf(axiom_71,axiom,
( p_Reset(X)
| p_Wr(X)
| ~ p_Rd(X)
| ~ gt(int_level(X),n0)
| int_level(plus(X,n1)) = minus(int_level(X),n1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV003-0.ax',axiom_71) ).
cnf(axiom_78,axiom,
( p_Reset(X)
| p_Wr(X)
| ~ p_Rd(X)
| gt(int_level(X),n0)
| int_level(plus(X,n1)) = int_level(X) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV003-0.ax',axiom_78) ).
cnf(quest_1,negated_conjecture,
~ gt(level(t_139),fifo_length),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',quest_1) ).
cnf(90,plain,
~ gt(int_level(t_139),fifo_length),
inference('REWRITE',[status(thm)],[quest_1,axiom_21,theory(equality)]) ).
cnf(quest_2,negated_conjecture,
p_Rd(t_139),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',quest_2) ).
cnf(quest_3,negated_conjecture,
~ p_Wr(t_139),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',quest_3) ).
cnf(quest_4,negated_conjecture,
~ p_Reset(t_139),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',quest_4) ).
cnf(quest_5,negated_conjecture,
p_Full(plus(t_139,n1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',quest_5) ).
cnf(quest_6,negated_conjecture,
gt(fifo_length,n0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',quest_6) ).
cnf(101,plain,
int_level(plus(t_139,n1)) = fifo_length,
inference('HYPERRESOLVE',[status(thm)],[axiom_23,quest_5]) ).
cnf(105,plain,
gt(fifo_length,minus(fifo_length,n1)),
inference('HYPERRESOLVE',[status(thm)],[axiom_3,quest_6]) ).
cnf(106,plain,
( X = n0
| gt(X,minus(X,n1)) ),
inference('HYPERRESOLVE',[status(thm)],[axiom_3,axiom_15]) ).
cnf(111,plain,
~ gt(n0,plus(X,n1)),
inference('UR-RESOLVE',[status(thm)],[axiom_13,axiom_17,axiom_2]) ).
cnf(121,plain,
( gt(n0,X)
| ~ gt(n1,plus(X,n1)) ),
inference('PARAMODULATE',[status(thm)],[axiom_9,axiom_19,theory(equality)]) ).
cnf(144,plain,
( plus(minus(X,Y),Y) = X
| def_10(Y,X) ),
inference('HYPERRESOLVE',[status(thm)],[axiom_4,theory(equality)]) ).
cnf(152,plain,
( n1 = fifo_length
| gt(fifo_length,n1) ),
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[axiom_14,quest_6]),axiom_19,theory(equality)]) ).
cnf(181,plain,
( gt(int_level(t_139),n0)
| fifo_length = int_level(t_139) ),
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[axiom_78,quest_2]),101,quest_3,quest_4,theory(equality)]) ).
cnf(188,plain,
( int_level(t_139) = n0
| fifo_length = minus(int_level(t_139),n1) ),
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[axiom_71,quest_2,axiom_15]),101,quest_3,quest_4,theory(equality)]) ).
cnf(224,plain,
( plus(minus(fifo_length,n1),n1) = fifo_length
| gt(fifo_length,plus(minus(fifo_length,n1),n1)) ),
inference('HYPERRESOLVE',[status(thm)],[axiom_14,105]) ).
cnf(225,plain,
~ gt(n0,X),
inference('UR-RESOLVE',[status(thm)],[axiom_14,111,axiom_1]) ).
cnf(226,plain,
~ gt(n1,plus(X,n1)),
inference('REWRITE',[status(thm)],[121,225]) ).
cnf(387,plain,
( plus(minus(fifo_length,n1),n1) = fifo_length
| n1 = fifo_length ),
inference('HYPERRESOLVE',[status(thm)],[axiom_6,144,152]) ).
cnf(423,plain,
int_level(t_139) = n0,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[106,188,theory(equality)]),90]) ).
cnf(434,plain,
fifo_length = n0,
inference('REWRITE',[status(thm)],[181,225,423,theory(equality)]) ).
cnf(435,plain,
plus(X,n1) != fifo_length,
inference('REWRITE',[status(thm)],[axiom_1,434,theory(equality)]) ).
cnf(437,plain,
gt(fifo_length,plus(minus(fifo_length,n1),n1)),
inference('REWRITE',[status(thm)],[224,435]) ).
cnf(438,plain,
n1 = fifo_length,
inference('REWRITE',[status(thm)],[387,435]) ).
cnf(504,plain,
~ gt(fifo_length,plus(X,fifo_length)),
inference('REWRITE',[status(thm)],[226,438,theory(equality)]) ).
cnf(587,plain,
$false,
inference('REWRITE',[status(thm)],[437,504,438,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : HWV017-1 : TPTP v8.1.0. Released v2.5.0.
% 0.15/0.14 % Command : run-snark %s %d
% 0.15/0.35 % Computer : n015.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 600
% 0.15/0.35 % DateTime : Fri Jun 17 05:37:57 EDT 2022
% 0.15/0.35 % CPUTime :
% 0.22/0.47 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.22/0.48 *
% 0.22/0.48 *
% 0.22/0.49 #<PACKAGE "SNARK-USER">
% 0.22/0.49 *
% 0.22/0.49 SNARK-TPTP-OPTIONS
% 0.22/0.49 *
% 0.22/0.49 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.22/0.49 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.22/0.49 (USE-FACTORING :POS)
% 0.22/0.49 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.22/0.49 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.22/0.49 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.22/0.49 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.22/0.49 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.22/0.49 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.22/0.49 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.22/0.49 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.22/0.49 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.22/0.49 (DECLARE-TPTP-SYMBOLS2))
% 0.22/0.49 *
% 0.22/0.49 "."
% 0.22/0.49 *
% 0.22/0.49 ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-17T05:37:57
% 0.22/0.49 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n015.cluster.edu at 2022-06-17T05:37:57
% 0.22/0.52
% 0.58/0.74 ; Recognized left identity assertion (= (|plus| |n0| ?X) ?X).
% 0.58/0.74
% 0.58/0.74 #||
% 0.58/0.74 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.58/0.74 % SZS output start Refutation
% See solution above
% 0.58/0.74 ||#
% 0.58/0.74
% 0.58/0.74 ; Summary of computation:
% 0.58/0.74 ; 1738 formulas have been input or derived (from 182 formulas).
% 0.58/0.74 ; 587 (34%) were retained. Of these,
% 0.58/0.74 ; 450 (77%) were simplified or subsumed later,
% 0.58/0.74 ; 137 (23%) are still being kept.
% 0.58/0.74 ;
% 0.58/0.74 ; Run time in seconds excluding printing time:
% 0.58/0.74 ; 0.022 9% Read assertion file (1 call)
% 0.58/0.74 ; 0.003 1% Assert (96 calls)
% 0.58/0.74 ; 0.051 21% Process new row (1,381 calls)
% 0.58/0.74 ; 0.024 10% Resolution (362 calls)
% 0.58/0.74 ; 0.006 2% Paramodulation (181 calls)
% 0.58/0.74 ; 0.000 0% Factoring (20 calls)
% 0.58/0.74 ; 0.007 3% Condensing (575 calls)
% 0.58/0.74 ; 0.023 9% Forward subsumption (575 calls)
% 0.58/0.74 ; 0.016 6% Backward subsumption (427 calls)
% 0.58/0.74 ; 0.009 4% Clause clause subsumption (878 calls)
% 0.58/0.74 ; 0.026 11% Forward simplification (1,373 calls)
% 0.58/0.74 ; 0.029 12% Backward simplification (586 calls)
% 0.58/0.74 ; 0.002 1% Ordering (2,239 calls)
% 0.58/0.74 ; 0.000 0% Sortal reasoning (32 calls)
% 0.58/0.74 ; 0.000 0% Purity testing (1 call)
% 0.58/0.74 ; 0.029 12% Other
% 0.58/0.74 ; 0.247 Total
% 0.58/0.74 ; 0.250 Real time
% 0.58/0.74 ;
% 0.58/0.74 ; Term-hash-array has 613 terms in all.
% 0.58/0.74 ; Feature-vector-row-index has 84 entries (317 at peak, 427 added, 343 deleted).
% 0.58/0.74 ; Feature-vector-row-index has 652 nodes (2,195 at peak, 3,143 added, 2,491 deleted).
% 0.58/0.74 ; Retrieved 1,538 possibly forward subsuming rows in 575 calls.
% 0.58/0.74 ; Retrieved 340 possibly backward subsumed rows in 427 calls.
% 0.58/0.74 ; Path-index has 189 entries (447 at peak, 647 added, 458 deleted).
% 0.58/0.74 ; Path-index has 700 nodes (887 at peak, 1,153 added, 453 deleted).
% 0.58/0.74 ; Trie-index has 189 entries (447 at peak, 647 added, 458 deleted).
% 0.58/0.74 ; Trie-index has 679 nodes (1,406 at peak, 2,162 added, 1,483 deleted).
% 0.58/0.74 ; Retrieved 2,312 generalization terms in 6,038 calls.
% 0.58/0.74 ; Retrieved 205 instance terms in 158 calls.
% 0.58/0.74 ; Retrieved 13,853 unifiable terms in 2,196 calls.
% 0.58/0.74 ;
% 0.58/0.74 ; The agenda of backward simplifiable rows to process has 207 entries:
% 0.58/0.74 ; 207 with value 0
% 0.58/0.74 ; The agenda of rows to process has 8 entries:
% 0.58/0.74 ; 2 with value 16 3 with value 26 2 with value 29
% 0.58/0.74 ; 1 with value 22
% 0.58/0.74 ; The agenda of input rows to give has 41 entries:
% 0.58/0.74 ; 1 with value 6 4 with value 15 2 with value 22
% 0.58/0.74 ; 1 with value 7 1 with value 16 1 with value 27
% 0.58/0.74 ; 2 with value 9 5 with value 18 6 with value 28
% 0.58/0.74 ; 1 with value 10 3 with value 19 1 with value 29
% 0.58/0.74 ; 1 with value 11 4 with value 20 2 with value 34
% 0.58/0.74 ; 3 with value 13 2 with value 21 1 with value 35
% 0.58/0.74 ; The agenda of rows to give has 80 entries:
% 0.58/0.74 ; 1 with value (4 5) 8 with value (4 14) 1 with value (4 26)
% 0.58/0.74 ; 1 with value (4 6) 6 with value (4 15) 7 with value (4 27)
% 0.58/0.74 ; 1 with value (4 7) 5 with value (4 17) 3 with value (4 29)
% 0.58/0.74 ; 2 with value (4 8) 7 with value (4 18) 2 with value (4 30)
% 0.58/0.74 ; 3 with value (4 9) 7 with value (4 20) 1 with value (4 32)
% 0.58/0.74 ; 4 with value (4 10) 2 with value (4 21) 1 with value (4 34)
% 0.58/0.74 ; 2 with value (4 11) 1 with value (4 22) 5 with value (4 39)
% 0.58/0.74 ; 1 with value (4 12) 4 with value (4 23) 3 with value (4 43)
% 0.58/0.74 ; 1 with value (4 13) 1 with value (4 25)
% 0.58/0.74 Evaluation took:
% 0.58/0.74 0.251 seconds of real time
% 0.58/0.74 0.226539 seconds of user run time
% 0.58/0.74 0.02404 seconds of system run time
% 0.58/0.74 [Run times include 0.008 seconds GC run time.]
% 0.58/0.74 0 calls to %EVAL
% 0.58/0.74 0 page faults and
% 0.58/0.74 17,977,416 bytes consed.
% 0.58/0.74 :PROOF-FOUND
% 0.58/0.74 ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-17T05:37:57
% 0.58/0.74 :PROOF-FOUND
% 0.58/0.74 *
%------------------------------------------------------------------------------