TSTP Solution File: SWV019-1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : SWV019-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n010.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 : Wed Jul 20 21:31:33 EDT 2022
% Result : Unsatisfiable 0.19s 0.50s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 10
% Syntax : Number of clauses : 22 ( 12 unt; 3 nHn; 20 RR)
% Number of literals : 49 ( 8 equ; 28 neg)
% Maximal clause size : 7 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 7 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(in_bounds,axiom,
( less_than(X,lower_bound)
| less_than(upper_bound,X)
| in_array_bounds(array,X) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',in_bounds) ).
cnf(predecessor_less,axiom,
( ~ less_than(successor(X),successor(Y))
| less_than(X,Y) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',predecessor_less) ).
cnf(transitivity_of_less,axiom,
( ~ less_than(X,Y)
| ~ less_than(Y,Z)
| less_than(X,Z) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',transitivity_of_less) ).
cnf(successor_greater,axiom,
less_than(X,successor(X)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',successor_greater) ).
cnf(this_is_maximal,axiom,
( ~ in_array_bounds(array,index_of_maximal)
| maximal_value = array_value_at(array,index_of_maximal) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',this_is_maximal) ).
cnf(maximal_before_somewhere,axiom,
less_than(index_of_maximal,an_index),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',maximal_before_somewhere) ).
cnf(somewhere_above_lower_bound,axiom,
~ less_than(an_index,lower_bound),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',somewhere_above_lower_bound) ).
cnf(somewhere_below_upper_bound,axiom,
~ less_than(upper_bound,an_index),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',somewhere_below_upper_bound) ).
cnf(maximal_above_lower_bound,axiom,
~ less_than(index_of_maximal,lower_bound),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',maximal_above_lower_bound) ).
cnf(prove_this,negated_conjecture,
( ~ in_array_bounds(array,an_index)
| less_than(successor(an_index),lower_bound)
| less_than(successor(upper_bound),successor(an_index))
| less_than(index_of_maximal,lower_bound)
| ~ less_than(index_of_maximal,successor(an_index))
| ~ in_array_bounds(array,index_of_maximal)
| maximal_value != array_value_at(array,index_of_maximal) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
cnf(11,plain,
( ~ in_array_bounds(array,an_index)
| less_than(successor(an_index),lower_bound)
| less_than(successor(upper_bound),successor(an_index))
| ~ less_than(index_of_maximal,successor(an_index))
| ~ in_array_bounds(array,index_of_maximal)
| maximal_value != array_value_at(array,index_of_maximal) ),
inference('REWRITE',[status(thm)],[prove_this,maximal_above_lower_bound]) ).
cnf(12,plain,
~ less_than(successor(upper_bound),successor(an_index)),
inference('UR-RESOLVE',[status(thm)],[predecessor_less,somewhere_below_upper_bound]) ).
cnf(13,plain,
( ~ in_array_bounds(array,an_index)
| less_than(successor(an_index),lower_bound)
| ~ less_than(index_of_maximal,successor(an_index))
| ~ in_array_bounds(array,index_of_maximal)
| maximal_value != array_value_at(array,index_of_maximal) ),
inference('REWRITE',[status(thm)],[11,12]) ).
cnf(16,plain,
in_array_bounds(array,an_index),
inference('UR-RESOLVE',[status(thm)],[in_bounds,somewhere_above_lower_bound,somewhere_below_upper_bound]) ).
cnf(17,plain,
( less_than(successor(an_index),lower_bound)
| ~ less_than(index_of_maximal,successor(an_index))
| ~ in_array_bounds(array,index_of_maximal)
| maximal_value != array_value_at(array,index_of_maximal) ),
inference('REWRITE',[status(thm)],[13,16]) ).
cnf(19,plain,
less_than(index_of_maximal,successor(an_index)),
inference('HYPERRESOLVE',[status(thm)],[transitivity_of_less,maximal_before_somewhere,successor_greater]) ).
cnf(20,plain,
( less_than(successor(an_index),lower_bound)
| ~ in_array_bounds(array,index_of_maximal)
| maximal_value != array_value_at(array,index_of_maximal) ),
inference('REWRITE',[status(thm)],[17,19]) ).
cnf(22,plain,
~ less_than(successor(an_index),lower_bound),
inference('UR-RESOLVE',[status(thm)],[transitivity_of_less,successor_greater,somewhere_above_lower_bound]) ).
cnf(23,plain,
( ~ in_array_bounds(array,index_of_maximal)
| maximal_value != array_value_at(array,index_of_maximal) ),
inference('REWRITE',[status(thm)],[20,22]) ).
cnf(26,plain,
in_array_bounds(array,index_of_maximal),
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[transitivity_of_less,in_bounds,maximal_before_somewhere]),somewhere_below_upper_bound,maximal_above_lower_bound]) ).
cnf(27,plain,
maximal_value = array_value_at(array,index_of_maximal),
inference('REWRITE',[status(thm)],[this_is_maximal,26]) ).
cnf(28,plain,
$false,
inference('REWRITE',[status(thm)],[23,27,26,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWV019-1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.13 % Command : run-snark %s %d
% 0.12/0.34 % Computer : n010.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 : Tue Jun 14 22:18:24 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-06-14T22:18:24
% 0.19/0.47 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n010.cluster.edu at 2022-06-14T22:18:24
% 0.19/0.50
% 0.19/0.50
% 0.19/0.50 #||
% 0.19/0.50 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.50 % SZS output start Refutation
% See solution above
% 0.19/0.50 ||#
% 0.19/0.50
% 0.19/0.50 ; Summary of computation:
% 0.19/0.50 ; 36 formulas have been input or derived (from 10 formulas).
% 0.19/0.50 ; 28 (78%) were retained. Of these,
% 0.19/0.50 ; 7 (25%) were simplified or subsumed later,
% 0.19/0.50 ; 21 (75%) are still being kept.
% 0.19/0.50 ;
% 0.19/0.50 ; Run time in seconds excluding printing time:
% 0.19/0.50 ; 0.002 7% Read assertion file (1 call)
% 0.19/0.50 ; 0.000 0% Assert (10 calls)
% 0.19/0.50 ; 0.002 7% Process new row (30 calls)
% 0.19/0.50 ; 0.000 0% Resolution (18 calls)
% 0.19/0.50 ; 0.001 3% Paramodulation (9 calls)
% 0.19/0.50 ; 0.000 0% Factoring (1 call)
% 0.19/0.50 ; 0.000 0% Condensing (9 calls)
% 0.19/0.50 ; 0.001 3% Forward subsumption (9 calls)
% 0.19/0.50 ; 0.000 0% Backward subsumption (9 calls)
% 0.19/0.50 ; 0.001 3% Forward simplification (30 calls)
% 0.19/0.50 ; 0.001 3% Backward simplification (27 calls)
% 0.19/0.50 ; 0.000 0% Ordering (5 calls)
% 0.19/0.50 ; 0.000 0% Sortal reasoning (32 calls)
% 0.19/0.50 ; 0.000 0% Purity testing (1 call)
% 0.19/0.50 ; 0.021 72% Other
% 0.19/0.50 ; 0.029 Total
% 0.19/0.50 ; 0.032 Real time
% 0.19/0.50 ;
% 0.19/0.50 ; Term-hash-array has 32 terms in all.
% 0.19/0.50 ; Feature-vector-row-index has 3 entries (5 at peak, 9 added, 6 deleted).
% 0.19/0.50 ; Feature-vector-row-index has 11 nodes (48 at peak, 112 added, 101 deleted).
% 0.19/0.51 ; Retrieved 0 possibly forward subsuming rows in 9 calls.
% 0.19/0.51 ; Retrieved 0 possibly backward subsumed rows in 9 calls.
% 0.19/0.51 ; Path-index has 38 entries (38 at peak, 47 added, 9 deleted).
% 0.19/0.51 ; Path-index has 56 nodes (56 at peak, 64 added, 8 deleted).
% 0.19/0.51 ; Trie-index has 38 entries (38 at peak, 47 added, 9 deleted).
% 0.19/0.51 ; Trie-index has 63 nodes (63 at peak, 81 added, 18 deleted).
% 0.19/0.51 ; Retrieved 17 generalization terms in 33 calls.
% 0.19/0.51 ; Retrieved 18 instance terms in 17 calls.
% 0.19/0.51 ; Retrieved 178 unifiable terms in 60 calls.
% 0.19/0.51 ;
% 0.19/0.51 ; The agenda of rows to process has 2 entries:
% 0.19/0.51 ; 1 with value 15 1 with value 21
% 0.19/0.51 ; The agenda of input rows to give has 1 entry:
% 0.19/0.51 ; 1 with value 7
% 0.19/0.51 ; The agenda of rows to give has 11 entries:
% 0.19/0.51 ; 3 with value (4 5) 3 with value (4 8) 1 with value (4 9)
% 0.19/0.51 ; 4 with value (4 7)
% 0.19/0.51 Evaluation took:
% 0.19/0.51 0.032 seconds of real time
% 0.19/0.51 0.029335 seconds of user run time
% 0.19/0.51 0.003254 seconds of system run time
% 0.19/0.51 0 calls to %EVAL
% 0.19/0.51 0 page faults and
% 0.19/0.51 2,914,904 bytes consed.
% 0.19/0.51 :PROOF-FOUND
% 0.19/0.51 ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-14T22:18:24
% 0.19/0.51 :PROOF-FOUND
% 0.19/0.51 *
%------------------------------------------------------------------------------