TSTP Solution File: SWW616_2 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : SWW616_2 : TPTP v8.1.0. Released v6.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n021.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 : Thu Jul 21 01:25:29 EDT 2022
% Result : Theorem 0.47s 0.65s
% Output : Refutation 0.47s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named 'CODE-FOR-$$UMINUS')
% Comments :
%------------------------------------------------------------------------------
tff(70,axiom,
! [X: $int,Y: $int,Z: map_int_int] :
( ~ $lesseq(X,Y)
| ( sum(Z,Y,X) = 0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sum_def_empty) ).
tff(78,axiom,
! [X: $int,Y: $int,Z: $int,U: map_int_int] :
( ~ $lesseq(X,Y)
| ~ $lesseq(Y,Z)
| ( sum(U,X,Z) = $sum(sum(U,X,Y),sum(U,Y,Z)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sum_transitivity) ).
tff(106,negated_conjecture,
'SKOLEMAAAW10.$int' = $sum('SKOLEMAAAW8.$int',div($difference('SKOLEMAAAW9.$int','SKOLEMAAAW8.$int'),2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',wP_parameter_maximum_subarray_rec) ).
tff(107,plain,
'SKOLEMAAAW10.$int' = $sum('SKOLEMAAAW8.$int',div($sum('SKOLEMAAAW9.$int',$product(-1,'SKOLEMAAAW8.$int')),2)),
inference('REWRITE',[status(thm)],[106,'CODE-FOR-$$UMINUS','CODE-FOR-$$DIFFERENCE']) ).
tff(108,negated_conjecture,
'SKOLEMAAAW11.$int' = $sum('SKOLEMAAAW8.$int',div($difference('SKOLEMAAAW9.$int','SKOLEMAAAW8.$int'),2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',wP_parameter_maximum_subarray_rec) ).
tff(109,plain,
'SKOLEMAAAW11.$int' = 'SKOLEMAAAW10.$int',
inference('REWRITE',[status(thm)],[108,107,'CODE-FOR-$$UMINUS','CODE-FOR-$$DIFFERENCE',theory(equality)]) ).
tff(115,negated_conjecture,
'SKOLEMAAAW13.$int' = sum('SKOLEMAAAW7.map_int_int','SKOLEMAAAW14.$int','SKOLEMAAAW11.$int'),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',wP_parameter_maximum_subarray_rec) ).
tff(116,plain,
'SKOLEMAAAW13.$int' = sum('SKOLEMAAAW7.map_int_int','SKOLEMAAAW14.$int','SKOLEMAAAW10.$int'),
inference('REWRITE',[status(thm)],[115,109,theory(equality)]) ).
tff(121,negated_conjecture,
! [X: $int] :
( ~ $lesseq('SKOLEMAAAW8.$int',X)
| ~ $lesseq(X,$sum('SKOLEMAAAW8.$int',div($difference('SKOLEMAAAW9.$int','SKOLEMAAAW8.$int'),2)))
| $lesseq(sum('SKOLEMAAAW7.map_int_int',X,$sum('SKOLEMAAAW8.$int',div($difference('SKOLEMAAAW9.$int','SKOLEMAAAW8.$int'),2))),sum('SKOLEMAAAW7.map_int_int','SKOLEMAAAW14.$int',$sum('SKOLEMAAAW8.$int',div($difference('SKOLEMAAAW9.$int','SKOLEMAAAW8.$int'),2)))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',wP_parameter_maximum_subarray_rec) ).
tff(122,plain,
! [X: $int] :
( ~ $lesseq('SKOLEMAAAW8.$int',X)
| ~ $lesseq(X,'SKOLEMAAAW10.$int')
| $lesseq(sum('SKOLEMAAAW7.map_int_int',X,'SKOLEMAAAW10.$int'),'SKOLEMAAAW13.$int') ),
inference('REWRITE',[status(thm)],[121,116,107,'CODE-FOR-$$UMINUS','CODE-FOR-$$DIFFERENCE',theory(equality)]) ).
tff(126,negated_conjecture,
$lesseq('SKOLEMAAAW8.$int','SKOLEMAAAW16.$int'),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',wP_parameter_maximum_subarray_rec) ).
tff(127,negated_conjecture,
$lesseq('SKOLEMAAAW16.$int',$sum('SKOLEMAAAW8.$int',div($difference('SKOLEMAAAW9.$int','SKOLEMAAAW8.$int'),2))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',wP_parameter_maximum_subarray_rec) ).
tff(128,plain,
$lesseq('SKOLEMAAAW16.$int','SKOLEMAAAW10.$int'),
inference('REWRITE',[status(thm)],[127,107,'CODE-FOR-$$UMINUS','CODE-FOR-$$DIFFERENCE',theory(equality)]) ).
tff(129,negated_conjecture,
$lesseq($sum('SKOLEMAAAW8.$int',div($difference('SKOLEMAAAW9.$int','SKOLEMAAAW8.$int'),2)),'SKOLEMAAAW17.$int'),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',wP_parameter_maximum_subarray_rec) ).
tff(130,plain,
$lesseq('SKOLEMAAAW10.$int','SKOLEMAAAW17.$int'),
inference('REWRITE',[status(thm)],[129,107,'CODE-FOR-$$UMINUS','CODE-FOR-$$DIFFERENCE',theory(equality)]) ).
tff(131,negated_conjecture,
$lesseq('SKOLEMAAAW17.$int',$sum('SKOLEMAAAW8.$int',div($difference('SKOLEMAAAW9.$int','SKOLEMAAAW8.$int'),2))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',wP_parameter_maximum_subarray_rec) ).
tff(132,plain,
$lesseq('SKOLEMAAAW17.$int','SKOLEMAAAW10.$int'),
inference('REWRITE',[status(thm)],[131,107,'CODE-FOR-$$UMINUS','CODE-FOR-$$DIFFERENCE',theory(equality)]) ).
tff(133,negated_conjecture,
~ $lesseq(sum('SKOLEMAAAW7.map_int_int','SKOLEMAAAW16.$int','SKOLEMAAAW17.$int'),'SKOLEMAAAW13.$int'),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',wP_parameter_maximum_subarray_rec) ).
tff(170,plain,
! [X: map_int_int] : ( sum(X,'SKOLEMAAAW10.$int','SKOLEMAAAW17.$int') = 0 ),
inference('HYPERRESOLVE',[status(thm)],[70,132]) ).
tff(269,plain,
$lesseq(sum('SKOLEMAAAW7.map_int_int','SKOLEMAAAW16.$int','SKOLEMAAAW10.$int'),'SKOLEMAAAW13.$int'),
inference('HYPERRESOLVE',[status(thm)],[122,126,128]) ).
tff(443,plain,
! [X: map_int_int] : ( sum(X,'SKOLEMAAAW16.$int','SKOLEMAAAW17.$int') = sum(X,'SKOLEMAAAW16.$int','SKOLEMAAAW10.$int') ),
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[78,128,130]),'CODE-FOR-$$SUM',170,theory(equality)]) ).
cnf(444,plain,
$false,
inference('REWRITE',[status(thm)],[133,269,443,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12 % Problem : SWW616_2 : TPTP v8.1.0. Released v6.1.0.
% 0.08/0.13 % Command : run-snark %s %d
% 0.14/0.35 % Computer : n021.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 : Sat Jun 4 09:38:48 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.20/0.47 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.48 *
% 0.20/0.48 *
% 0.20/0.49 #<PACKAGE "SNARK-USER">
% 0.20/0.49 *
% 0.20/0.49 SNARK-TPTP-OPTIONS
% 0.20/0.49 *
% 0.20/0.49 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.20/0.49 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.20/0.49 (USE-FACTORING :POS)
% 0.20/0.49 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.20/0.49 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.20/0.49 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.20/0.49 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.20/0.49 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.20/0.49 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.20/0.49 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.20/0.49 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.20/0.49 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.20/0.49 (DECLARE-TPTP-SYMBOLS2))
% 0.20/0.49 *
% 0.20/0.49 "."
% 0.20/0.49 *
% 0.20/0.49 ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-04T09:38:49
% 0.20/0.49 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n021.cluster.edu at 2022-06-04T09:38:49
% 0.36/0.53 WARNING: Cannot use equality or equivalence (= ?X.tuple0 tuple02) as rewrite.
% 0.47/0.65
% 0.47/0.65
% 0.47/0.65 #||
% 0.47/0.65 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.47/0.65 % SZS output start Refutation
% See solution above
% 0.47/0.65 ||#
% 0.47/0.65
% 0.47/0.65 ; Summary of computation:
% 0.47/0.65 ; 1123 formulas have been input or derived (from 103 formulas).
% 0.47/0.65 ; 444 (40%) were retained. Of these,
% 0.47/0.65 ; 35 ( 8%) were simplified or subsumed later,
% 0.47/0.65 ; 409 (92%) are still being kept.
% 0.47/0.65 ;
% 0.47/0.65 ; Run time in seconds excluding printing time:
% 0.47/0.65 ; 0.024 15% Read assertion file (1 call)
% 0.47/0.65 ; 0.004 2% Assert (64 calls)
% 0.47/0.65 ; 0.039 24% Process new row (883 calls)
% 0.47/0.65 ; 0.020 12% Resolution (204 calls)
% 0.47/0.65 ; 0.002 1% Paramodulation (102 calls)
% 0.47/0.65 ; 0.000 0% Factoring (19 calls)
% 0.47/0.65 ; 0.004 2% Condensing (220 calls)
% 0.47/0.65 ; 0.005 3% Forward subsumption (220 calls)
% 0.47/0.65 ; 0.001 1% Backward subsumption (212 calls)
% 0.47/0.65 ; 0.001 1% Clause clause subsumption (172 calls)
% 0.47/0.65 ; 0.022 14% Forward simplification (854 calls)
% 0.47/0.65 ; 0.003 2% Backward simplification (422 calls)
% 0.47/0.65 ; 0.002 1% Ordering (525 calls)
% 0.47/0.65 ; 0.004 2% Sortal reasoning (3,731 calls)
% 0.47/0.65 ; 0.000 0% Purity testing (1 call)
% 0.47/0.65 ; 0.029 18% Other
% 0.47/0.65 ; 0.160 Total
% 0.47/0.65 ; 0.163 Real time
% 0.47/0.65 ;
% 0.47/0.65 ; Term-hash-array has 917 terms in all.
% 0.47/0.65 ; Feature-vector-row-index has 212 entries (212 at peak, 212 added, 0 deleted).
% 0.47/0.65 ; Feature-vector-row-index has 1,452 nodes (1,452 at peak, 1,452 added, 0 deleted).
% 0.47/0.65 ; Retrieved 189 possibly forward subsuming rows in 220 calls.
% 0.47/0.65 ; Retrieved 21 possibly backward subsumed rows in 212 calls.
% 0.47/0.65 ; Path-index has 917 entries (922 at peak, 938 added, 21 deleted).
% 0.47/0.65 ; Path-index has 3,240 nodes (3,251 at peak, 3,272 added, 32 deleted).
% 0.47/0.65 ; Trie-index has 917 entries (922 at peak, 938 added, 21 deleted).
% 0.47/0.65 ; Trie-index has 2,634 nodes (2,654 at peak, 2,708 added, 74 deleted).
% 0.47/0.65 ; Retrieved 4,684 generalization terms in 2,816 calls.
% 0.47/0.65 ; Retrieved 302 instance terms in 209 calls.
% 0.47/0.65 ; Retrieved 8,950 unifiable terms in 1,074 calls.
% 0.47/0.65 ;
% 0.47/0.65 ; The agenda of backward simplifiable rows to process has 2 entries:
% 0.47/0.65 ; 2 with value 0
% 0.47/0.65 ; The agenda of rows to process has 146 entries:
% 0.47/0.65 ; 53 with value 18 4 with value 30 3 with value 46
% 0.47/0.65 ; 1 with value 21 2 with value 31 2 with value 47
% 0.47/0.65 ; 22 with value 22 1 with value 34 1 with value 49
% 0.47/0.65 ; 14 with value 23 1 with value 37 2 with value 52
% 0.47/0.65 ; 1 with value 25 11 with value 38 1 with value 58
% 0.47/0.65 ; 13 with value 26 1 with value 39 2 with value 61
% 0.47/0.65 ; 7 with value 27 1 with value 42 1 with value 75
% 0.47/0.65 ; 1 with value 29 1 with value 43
% 0.47/0.65 ; The agenda of input rows to give has 9 entries:
% 0.47/0.65 ; 1 with value 26 1 with value 31 1 with value 36
% 0.47/0.65 ; 1 with value 27 1 with value 32 2 with value 41
% 0.47/0.65 ; 2 with value 29
% 0.47/0.65 ; The agenda of rows to give has 307 entries:
% 0.47/0.65 ; 12 with value (4 5) 20 with value (4 18) 9 with value (4 30)
% 0.47/0.65 ; 7 with value (4 7) 16 with value (4 19) 4 with value (4 31)
% 0.47/0.65 ; 6 with value (4 8) 13 with value (4 20) 2 with value (4 32)
% 0.47/0.65 ; 15 with value (4 9) 6 with value (4 21) 2 with value (4 33)
% 0.47/0.65 ; 21 with value (4 10) 4 with value (4 22) 4 with value (4 34)
% 0.47/0.65 ; 5 with value (4 11) 16 with value (4 23) 2 with value (4 37)
% 0.47/0.65 ; 26 with value (4 12) 5 with value (4 24) 3 with value (4 39)
% 0.47/0.65 ; 14 with value (4 13) 10 with value (4 25) 1 with value (4 41)
% 0.47/0.65 ; 21 with value (4 14) 7 with value (4 26) 1 with value (4 42)
% 0.47/0.65 ; 10 with value (4 15) 5 with value (4 27) 2 with value (4 45)
% 0.47/0.65 ; 16 with value (4 16) 5 with value (4 28) 1 with value (4 48)
% 0.47/0.65 ; 12 with value (4 17) 4 with value (4 29)
% 0.47/0.65 Evaluation took:
% 0.47/0.65 0.163 seconds of real time
% 0.47/0.65 0.135197 seconds of user run time
% 0.47/0.65 0.028284 seconds of system run time
% 0.47/0.65 0 calls to %EVAL
% 0.47/0.65 0 page faults and
% 0.47/0.65 10,552,816 bytes consed.
% 0.47/0.65 :PROOF-FOUND
% 0.47/0.65 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-04T09:38:49
% 0.47/0.65 :PROOF-FOUND
% 0.47/0.65 *
%------------------------------------------------------------------------------